Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Given a binary array **A[]** of size **N**. The task is to arrange the array in increasing order.

**Note:** The binary array contains only 0 and 1.

**Example 1:**

**Input**:
5
1 0 1 1 0
**Output**:
0 0 1 1 1
**Explanation**:
After arranging the elements in
increasing order, elements will be as 0 0 1 1 1.

**Example 2:**

**Input**:
10
1 0 1 1 1 1 1 0 0 0
**Output**:
0 0 0 0 1 1 1 1 1 1
**Explanation**:
After arranging the elements in
increasing orde, elements will be
0 0 0 0 1 1 1 1 1 1.

**Your Task: **This is a function problem. You only need to complete the function** binSort() **that takes the array **A[] **and it's size **N** as parameters and sorts the array. The **printing **is done **automatically **by the driver code.

**Expected Time Complexity**: O(N)

**Expected Auxilliary Space**: O(1)

**Constraints:**

1 <= N <= 10^{6}

0 <= A[i] <= 1

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Binary Array Sorting

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.