In this tutorial, we are going to discuss three O (n log n) sorting techniques, their implementations, and how we derive their runtimes. The learning objectives of this tutorial are as follows:
- You will be able to apply the
Divide-and-Conquerapproach to different sorting methods. - You will be able to sort an array in
O(N log N)complexity. - We'll learn how to build Max & Min Heaps and apply them to sort an array.