Given the following array (unordered + duplicate) [0, 0, 2, 1, 2, 2, 0, 1, 1, 0, 0, 0], rearrange like [0, 0, 0, 0, 0, 2, 2, 2, 1, 1, 1]
How this could be solved with O(n) time complextity in c#?
Comments (0)
Given the following array (unordered + duplicate) [0, 0, 2, 1, 2, 2, 0, 1, 1, 0, 0, 0], rearrange like [0, 0, 0, 0, 0, 2, 2, 2, 1, 1, 1]
How this could be solved with O(n) time complextity in c#?