Assume that that after analysizng a recursive function to find it's T(n) you find that T(n) =
Fantastic news! We've Found the answer you've been seeking!
Question:
Assume that that after analysizng a recursive function to find it's T(n) you find that
T(n) = 1 + 2 * T(n/4)
What is the big O performance of this function? Is it faster or slower than binay search? Is it faster or slowe than merge sort?
Hint: a ^ ( log x in base a^k) = x^(1/k)
Related Book For
Project Management The Managerial Process
ISBN: 9781260570434
8th Edition
Authors: Eric W Larson, Clifford F. Gray
Posted Date: