The code contains 8 different sorting algorithms. The Names and the line number at which you can find the function is listed below.
The code also contains a utility function for finding time required to sort the array by each algorithm.
| Algorithm Name | Line Number |
|---|---|
| Selection Sort | 5 |
| Insertion Sort | 25 |
| Bubble Sort | 47 |
| Shell Sort | 65 |
| Merge Sort | 91 |
| Quick Sort | 152 |
| Count Sort | 193 |
| Radix Sort | 220 |
| Heap Sort | 250 |
| Bucket Sort | 274 |