About this document
Binary Search Algorithm by Phuong Bui is a document available to read on EtoBox.
The Binary Search Algorithm is a fast search method with a time complexity of O(log n) that operates on sorted arrays by repeatedly dividing the search interval in half. It compares the middle element of the array to the target value, adjusting the search range based on whether the target is greater or less than the middle element. If the target is found, its index is returned; if not, the algorithm concludes an unsuccessful search when the subarray size reduces to zero.
- Author
- Phuong Bui
- Language
- EN