Hard
Master theorem on T(n) = 2T(n/2) + n log n
Apply the master theorem to T(n) = 2T(n/2) + n log n. Here a=2, b=2, so n^(log_b a) = n^1 = n, and f(n) = n log n. What is T(n)?
27 of 46 in Data Structures & Algorithms
Apply the master theorem to T(n) = 2T(n/2) + n log n. Here a=2, b=2, so n^(log_b a) = n^1 = n, and f(n) = n log n. What is T(n)?