Intermediate
Big O Notation Formal Proof
Mathematically prove the asymptotic upper bound of a recursive function.
📝 Prompt-Inhalt
Using the formal definition of Big O notation, prove that the recurrence relation T(n) = 2T(n/2) + n is O(n log n). Detail every step of the substitution method or the recursion tree analysis used in your derivation.