Java

Design an algorithm that takes an array of positive and negative elements and rearranges them such that all negative numbers proceed all the positive numbers. Your solution must do this in place so no new arrays are allocated. (Note the elements don't have to be sorted). What's the running time of your algorithm? Is it optimal (cannot be improved)? Design an algorithm that takes an array that is filled with characters that can be A, B or C. Design an algorithm that will rearrange the elements so that all A's proceed all the B's and all B's proceed all the C's. Your solution must do this in place so no new arrays are allocated and perform it in one pass over the values. Hint: You might want to think of how quick sort partition works and modify it to work for this