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.

The recursive MergeSort is a O(N * log₂N) algorithm.

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