Speed of Sorting Algorithms
Most Sorting algorithms run in n lg n time for the worst case.
Quick Sort runs a little faster for the average case. So it is usually the sort that’s used. The algorithm for Quick Sort is quite complicated. It is shown in your book. There is a pre-written function called qsort in the C standard library.