Summary
In this chapter, we've learned about simple sorting and divide and conquer strategies where the entire sorting process can be performed in memory. You learned about the insertion sort which is good for working with very small datasets. We then moved on to two popular divide and conquer strategy sorting routines: merge sort and quick sort.
By now you should have a good understanding of how to implement these algorithms and customize them based on your specific performance requirements.
In the next chapter, we're going to learn about various tree data structures and algorithms.
