Quick Sort sorts all or most of the data in one go, if it is a lot of data it might take more than one step but it gets sorted quickly so it is very efficient.
This shows a large list which has been sorted in 2 steps, this also shows that quick sort is a very efficient method.
INSERTION SORT:
The same small set of data for insertion sort took longer to complete. It took 3 steps to complete the insertion sort which shows that the Quick Sort is the more efficient.
A larger list takes a longer time and more steps to do so.
BUBBLE SORT:
The same small set of data for bubble sort took less steps to complete. It took 2 steps to complete the bubble sort which shows that the Quick Sort is the more efficient method. However this is because the bubble sort compares in pairs so this set of data was easy to do for the bubble sort a larger set of data as can be seen below will have a lot more steps which will show that even the insertion sort is better than the bubble sort.
Final Rankings:
1) Quick Sort
2) Insertion Sort
3) Bubble Sort
