Run the following applet using list sizes of 25, 50, 100, 500, and 1000. Record the results between each run.
Take the results from the five runs and sum the number of swaps and the number of comparisons. Then rank order the sorting algorithms on the basis of this total. From these observations, can you break the sorts into O(N*N) and O(NlogN)? Is this breakdown different than the one from the last exercise? Which one seems to change groups?