Explanation: The complexity class where execution time grows in proportion to n times log n. Typical in efficient sorting algorithms like Merge Sort and Heap Sort.