Log Linear means that it needs to look at every element (n part) and then perform divide-and-conquer operation (log n part) for each. Examples of algorithms that are Log Linear complex: - Merge Sort - Quick Sort - Heap Sort ### See also 1. [[Linear Time Complexity - O(n)]] 2. [[Logarithmic Time Complexity - O(log n)]]