# Modified Binary Search Algorithm

arXiv: https://arxiv.org/abs/1406.1677 · HTML: https://mlsanity.com/paper/1406.1677/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Jun 2014.

## Built on by (most cited first, 4 of 4)

- [Binary Bleed: Fast Distributed and Parallel Method for Automatic Model Selection](https://mlsanity.com/paper/2407.19125/) (2024)
- [From Large-scale Audio Tagging to Real-Time Explainable Emergency Vehicle Sirens Detection](https://mlsanity.com/paper/2506.23437/) (2025)
- [Real-Time Emergency Vehicle Siren Detection with Efficient CNNs on Embedded Hardware](https://mlsanity.com/paper/2507.01563/) (2025)
- [Trustworthy Domain-Specific AI for Structured Knowledge Retrieval and Reasoning](https://mlsanity.com/paper/2610.08894/) (2026)

## Abstract (arXiv)

This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input element with the middle element of the given set of elements at each iteration. Modified binary search algorithm optimizes the worst case of the binary search algorithm by comparing the input element with the first & last element of the data set along with the middle element and also checks the input number belongs to the range of numbers present in the given data set at each iteration there by reducing the time taken by the worst cases of binary search algorithm.