Skip to main content
Lesson 24 - Order of Algorithms
ZIPPDF (letter)
Lesson MenuPreviousNext
  
N * Log2N Algorithms, O(N * log2N) page 7 of 11

  1. Algorithms of this type have a log2N concept that must be applied N times.

  2. When recursive MergeSort and Quicksort are covered, we will discover that they are O(N * log2N) algorithms.

  3. As the graph shows, These algorithms are markedly more efficient than our next category, quadratics.


Lesson MenuPreviousNext
Contact
 ©ICT 2003, All Rights Reserved.