Hi

I am studying algorithm, but I don't unberstand for this question. Please help me..

Suppose that an array A contains numbers that are either 0 or 1 (a) Provide a (worst case) linear time algorithm to sort such an array (hint: modify partition) (b) Argue why this does not violate the (n lg n) bound for comparison based sorting. c)Suppose now that the elements consist of numbers from 0 to 5. Can you still use a variation of your algorithm to sort the list in (worst case) linear time