Given an unsorted array of integers, sort them in such a way that all negatives come first, followed by zeroes, followed by all positives.
5,-6,8,0,4,-10,11
could become
-6,-10,0,8,4,11 (does not have to be sorted into increasing order)
What is the run time of this? Can we reduce the run time, if so, how (implement the new way)? Doing black box testing, how can we determine the run time? How can we determine if we have a memory leak?