This chapter covered sorting algorithms such as bubble, selection, insertion, shell, merge, and quick sort. Search algorithms such as linear, binary, and interpolation were the discussed. Finally, the recursion and hashing algorithms were explained with code snippets. All of the algorithms were discussed alongside code examples and performance analysis.
In the next chapter, network representation using graphs and sparse matrix representation using list of lists will be covered, along with appropriate examples.