Given an array consisting only zeros, ones and twos. Give an algorithm for sorting the array in O(n) time complexity ( in the sorted array, zeros will be at starting ,then the ones & then the twos)
belongs to collection: Interview C++ coding problems/challenges | Coding Algorithms
All Answers
total answers (1)
Algorithm
Swap (array [low], array [mid]) since 0's should be at starting
Increment low
Increment mid
Break statement
Keep as it is since 1's should be at middle after being sorted
Increment mid
Break statement
Swap (array [mid], array [high])
Decrement high
Break statement
C++ program to sort an array of 0's, 1's and 2's in linear time complexity
Output
need an explanation for this answer? contact us directly to get an explanation for this answer