In this chapter, you learned about sorting and searching algorithms. You learned the bubble, selection, insertion, merge, and quick sort algorithms, which are used to sort data structures. You also learned the sequential search and binary search (which required the data structure to be sorted already).

You can apply any logic you learned in this chapter to any data structure or any type of data. You just need to make the necessary modifications on the source code.

In the next chapter, you will learn some advanced techniques used in algorithms and also more about the big O notation that was mentioned in this chapter.