Sorting Algorithms Proof-of-Concept
This program tests the efficiency of several sorting algorithms, including bubbleSort, insertionSort, mergeSort, quickSort, and selectionSort. It can sort any size of array from size 10 to size 10 million, and in either ascending, descending, or random order. The purpose is to find the time it took to search the array for research purposes.
I'm including the makefile, but I wrote it to work on a linux machine so you may need to tweak it to work for you. To compile it, just type makefile into the prompt. Once compiled, execute the program in the terminal in the following format: ./[name of program] [data_size] [random/ascending/descending] [selection/insertion/bubble/merge/quick] . I'm also including all five sort algorithms and the declarations file.