Comparison of Sorting Algorithms: Bubble, Insertion, Quick, and Shell Sort Algorithms

Compare the sorting algorithms of Bubble Sort, Insertion Sort, Quick Sort, and Shell Sort. Generate 1000 random integers between 0 and 999 using a program (stored in a data file). Select any two sorting methods to sort these 1000 data points and compare the efficiency of the two methods. Four sorting algorithms were used: Bubble Sort, Insertion Sort, Quick Sort, and Shell Sort. The sorting times were also compared.

Below is a comparison of the time usage for each sorting algorithm: