N * log(N) Algorithms, O(N * log(N))

1. Algorithms of this type, seen in line D on the Order of Algorithms graph, have a log N procedure that must be applied N times or an N procedure applied log N times.

2. The recursive MergeSort is a O(N * log₂N) algorithm (although more generally you could just say O(N * log N) as the base is not important in Big-O).

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