In this chapter, we learned about sorting, searching, and shuffling algorithms.
We learned about the bubble, selection, insertion, merge, quick, counting, bucket, and radix sort algorithms, which are used to sort data structures. We also learned about the sequential search, interpolation search, and binary search (which require the data structure to be sorted already). We also covered how to shuffle values of an array.
In the next chapter, we will learn about some advanced techniques used in algorithms.
