Datasets from searches
...to 80,000 beyond that the algorithm broke down further to 6 times as long. The select sort is clearly not the algorithm of choice when sorting arrays of thousands of elements. With Ascending numbers, all of the algorithms seemed to have an easier time sorting than with random. There would be no swaps necessary as the element is already in order. I believe this is why we see the small improvement from the random data sorts. All three of the sorts performed better on this test than any other. The manner in which they performed stayed the same as the searches with random data. Descending numbers was a little bit different. The quick sort I used was able to handle the standard “worst case” for quick sorts and managed to keep it as the fastest sort of the three. The merge sort did slow down measurably it had the largest difference percentage wise of the three sorts. The select sort also slowed down measurably from the previous dataset but was still faster than sorting random data. The quick sort is obviously the best sort for this type of information. I imagine the recursive nature would become a problem with very large amounts of data as the stack could fill causing the system to crash. However with ...