Thirteen Sorting Methods (Sorting V2.0)
This code is a newer revision of my ten sorts program. The added sorts are the following: Bucket Sort, Binary Insertion Sort, and Quick Sort with Bubble Sort. Each of the algorithms has it's own special advantages and disadvantages. New added features are generating lists that are random, sorted, or in reverse order. These lists can be generated in either 10 items, 500 items, 5000 items, or a custom list size! You can now also time how long the sort takes now! New sorts will be added as I discover them. Please leave feedback for more features!
Inputs
Some sorts need just the unsorted array and the number of items in the array, however, some sorts need also need a temporary array that is the same size as the unsorted array.
Assumes
The bucket sort only works if there is no number less than 0 in the list, and there is no number in the list that is bigger than the number of items in the list. It is a very specific sort. There are also two unfinished and partially working sorts in the source. The bitonic sort, and the bottom-up merge sort, they will be finished soon, feel free to try and fix them yourselves!
Returns
Returns the sorted list!
Side Effects
None that I'm aware of!
(2(2 Vote))