Big O Notation Basics

The algorithm runs in constant time regardless of input size The running time grows proportionally to n multiplied by log n, common in efficient sorting algorithms like mergesort The algorithm requires n log n bytes of memory The algorithm makes exactly n log n comparisons, no more and no less