🌳What is O(n log n)?

Let's see "why n × log n" with a tree! 📊 Key Points: • Level count = log₂(n) = times we divide • Each level processes n elements Look at the tree: See "= 8" on the right of each level? We process n elements at every level!