| |
N * Log2N Algorithms, O(N * log2N) | page 7 of 11 |
Algorithms of this type have a log2N concept that must be applied N times.
When recursive MergeSort and Quicksort are covered, we will discover that they are O(N * log2N) algorithms.
As the graph shows, These algorithms are markedly more efficient than our next category, quadratics.
|