Edit MetaData
The recurrence relation that arises in relation with the complexity of binary search is
$$T(n) =2T(\frac{n}{2})+k$$, where k is constant
$$T(n) =T(\frac{n}{2})+k$$, where k is constant
$$T(n) =T(\frac{n}{2})+log n$$, where k is constant
$$T(n) =T(\frac{n}{2})+n$$, where k is constant
Create a FREE account and get:
Login to your Cracku account.
Enter Valid Email
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulae PDF will be sent to your email address soon !!!
Join cracku.in for Expert Guidance.