Timing of Sorting Methods

Here is a comparison of selection sort and merge sort. A list of Integer objects is generated at random, two copies are made, and a copy is sorted by each of the two methods. The time taken by each is computed in milliseconds. The quantity of objects sorted ranges from 100 to 10,000. The software that was used for this purpose can be found by clicking here. You will also need MergeSort and Sorting, which provide the sorting methods being timed. Here is a chart of the performance. Of course each run will yield slightly different numbers, as will runs on different computers.