Summary
This was a comprehensive chapter that covered sorting and searching algorithms. You saw the implementations of Merge Sort, Quick Sort, Radix Sort, Heap Sort, Bucket Sort, and Binary Search. Moreover, in the code bundled with this book, there's an application called SortArraysIn14Ways that contains the implementations of 14 sorting algorithms.
In the next chapter, we will cover a suite of problems categorized as mathematical and puzzle problems.