About this document
Binary Search Recurrence by lalak4529 is a document available to read on EtoBox.
A recurrence relation expresses the running time of an algorithm in terms of smaller input sizes, commonly used in divide and conquer and recursive algorithms. Binary search is a divide and conquer algorithm that efficiently searches a sorted array by repeatedly halving the search space. The time complexity of binary search is defined by the recurrence relation T(n) = T(n/2) + c, leading to a final result of T(n) = O(log n).
- Author
- lalak4529
- Language
- EN