August 2024
Intermediate to advanced
516 pages
11h 47m
English
As of this writing, the fastest sorting algorithms we know of have speeds of O(N log N). While Quicksort is one of the most popular among them, there are many others as well. Mergesort is another well-known O(N log N) sorting algorithm and will be covered in Volume 2 of this book.
The fact that the fastest sorting algorithms are O(N log N) is important, as this has implications for other algorithms as well. This is because there are algorithms that use sorting as a component of a larger process.
For example, if you’ll recall from Chapter 4, Speeding Up Your Code with Big O, we dealt with the problem of checking whether there are duplicate values within an array.
The first solution we looked at involved ...
Read now
Unlock full access