Algorithms Searching, Sorting and Hashing Searching

The recurrence relation that arises in relation with the Complexity of binary search is

1
T(n) = T(n/2) + k , k a constant
2
T(n) = 2. T(n/2) + k , k a constant
3
T(n) = T(n/2) + log n
4
T(n) = T(n/2) + n
5
T(n) = T(n/2) + n2

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters