Search 250 million research papers

Binary search algorithm

Oskirko, A. V., Pogonya, S. S. · Repository of Belarusian National Technical University (Belarusian National Technical University) · 2025

Cited by 0Open access

Binary search algorithm

Anthony Lin · WikiJournal of Science · 2019

In In computer science, binary search, also known as half-interval search, Binary search compares the target value to an element in the middle of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array. Binary search runs in logarithmic time in the worst case, making (log ) comparisons, where is the number of elements in the array, the is 'Big O' notation, and is the logarithm. Binary search is faster than linear search except for small arrays. However, the array must be sorted first to be able to apply binary search. There are specialized data structures designed for fast searching, such as hash tables, that can be searched more efficiently than binary search. However, binary search can be used to solve a wider range of problems, such as finding the nextsmallest or next-largest element in the array relative to the target even if it is absent from the array.

Cited by 50Open access

Development Binary Search Algorithm

Ragheed D. Salim · Baghdad Science Journal · 2011

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case complexity of Search) is O(log2 n) (pronounce this "big-Oh-n" or "the order of magnitude"), if we search in a list consists of (N) elements. In this research the number of comparison is reduced to triple by using Triple structure, this process makes the maximum number of comparisons is O(log2 (n)/3+1) if we search key in list consist of (N) elements.

Cited by 0Open access

Binary Search Forest Algorithm

Zhang, Shangshan · SHAREOK (University of Oklahoma; Oklahoma State University; Central Oklahoma University) · 2014

Cited by 0Open access

Binary search tree visualization algorithm

Vadym Borovskiy, Juller Muller, Matthieu-P. Schapranow et al. · 2009

Binary search tree is a very common data structure in computer programming. Working with large BSTs can become complicated and inefficient unless a programmer can visualize them. This article contributes with two BST visualization algorithms that draw a tree in time linearly proportional to the number of nodes in a tree.

Cited by 5

BOSA: Binary Orientation Search Algorithm

Mohammad Dehghani, Zeinab Montazeri, Om Parkash et al. · International Journal of Innovative Technology and Exploring Engineering · 2019

Optimization algorithms have many applications in solve the optimization problems in various sciences. The Orientation Search Algorithm (OSA) is an optimizer that is simulated the rules of a game called orientation game. In OSA searcher agent are players of orientation game that moves on the playground depending on the direction of the referee. in this study, binary model of OSA which called Binary Orientation Search Algorithm (BOSA) is proposed. BOSA and eight other algorithms (BGA, BPSO, BGSA, BGOA, BBA, BMOA, and BDA) are tested on twenty-three Benchmark test function. Proposed BOSA has a high ability to solve optimization problems compared to other algorithms according to the evaluation results.

Cited by 84Open access

BSSA: Binary spring search algorithm

Mohammad Dehghani, Zeinab Montazeri, Ali Dehghani et al. · 2017

The applications of population-based heuristic optimization techniques, which randomly but guided search the optimization space, are increasing in variety of scientific realms. The idea behind most of these algorithms is based on physical phenomena or the behavior of creatures. In this paper, a novel heuristic optimization approach is introduced for finding the sub-optimal solutions of optimization problems. The proposed method is called the spring search algorithm (SSA), which is among the heuristic optimization techniques inspired from the physical rules where the search operators are a set of objects, and its binary version, which entitled binary spring search algorithm (BSSA), is formulated and investigated. The optimization results on a number of standard test functions show the efficacy of the proposed technique compared to those of the genetic algorithms and the improved version of the particle swarm optimization technique.

Cited by 21

Algorithm of binary search :Rcpp code

M. E., Macherki · Figshare · 2016

A binary search divides a range of values(sorted array) into halves by the median point(noted k), and continues tonarrow down the field of search until the pattern(noted x) is found. It is the classic example of a "divide and conquer" algorithm.

Cited by 0Open access

Algorithm of binary search :Rcpp code

M. E. Macherki · Figshare · 2016

A binary search divides a range of values(sorted array) into halves by the median point(noted k), and continues tonarrow down the field of search until the pattern(noted x) is found. It is the classic example of a "divide and conquer" algorithm.

Cited by 0Open access

Hardware realisation of binary search algorithm

F.K. Hanna, A.K. Misra · IEE Proceedings E Computers and Digital Techniques · 1980

It is shown how, by augumenting a microprocessor or mincomputer with a relatively small amount of iteratively driven logic, the operation of table lookup using a binary search algorithm can be speeded up by 1½ to 2 orders of magnitude. The approach is very suitable for 1.s.i. implementation as a standard peripheral device for a microprocessor.

Cited by 3

The optimal binary search tree for Andersson's search algorithm

David Spuler · Acta Informatica · 1993

Cited by 2

Improved Binary Tree Search Anti-Collision Algorithm

Chao Li, Hai Ling Xiong · Applied Mechanics and Materials · 2013

According to the issue of tag collision in the radio frequency identification technology, this paper proposes a binary tree search anti-collision algorithm, which takes different processing methods according to how many continuous collision. Compared with the dynamic binary tree search algorithm, the improved algorithm reduces the query information send by the reader. At the same time,the algorithm in the process of identifying tags reduces the query information, the query number and tag response times, so as to shorten the recognition time, further improve the search performance.

Cited by 2

Binary Sparrow Search Algorithm for Feature Selection

Xu Yuan Xu Yuan, Jeng-Shyang Pan Xu Yuan, Ai-Qing Tian Jeng-Shyang Pan et al. · 網際網路技術學刊 · 2023

<>The sparrow search algorithm (SSA) is a novel intelligent optimization algorithm that simulates the foraging and anti-predation behavior of sparrows. The sparrow search algorithm (SSA) can optimize continuous problems, but in reality many problems are binary problems. In this paper, the binary sparrow search algorithm (BSSA) is proposed to solve binary optimization problems, such as feature selection. The transfer function is crucial to BSSA and it directly affects the performance of BSSA. This paper proposes three new transfer functions to improve the performance of BSSA. Mathematical analysis revealed that the original SSA scroungers position update equation is no longer adapted to BSSA. This paper improves the position update equation. We compared BSSA with BPSO, BGWO, and BBA algorithms, and tested on 23 benchmark functions. In addition, statistical analysis of the experimental results, Friedman test and Wilcoxon rank-sum test were performed to verify the effectiveness of BSSA. Finally, the algorithm was used to successfully implement feature selection and obtain satisfactory results in the UCI data set.<>

Cited by 10Open access

tabuSearch: Tabu Search Algorithm for Binary Configurations

Katarina Domijan · 2011

Tabu search algorithm for binary configurations. A basic version of the algorithm as described by Fouskakis and Draper (2007) &lt;<a href="https://doi.org/10.1111%2Fj.1751-5823.2002.tb00174.x" target="_top">doi:10.1111/j.1751-5823.2002.tb00174.x</a>&gt;.

Cited by 1Open access

Binary Search Algorithm Based Photovoltaic System Emulator

Chelumgari Swathi Akshaya, R. Ishemgulov R., H P Lee et al. · 2025

Emulation of Photovoltaic(PV) systems makes testing power converters and control systems safer, more regular, and affordable. Conventional PV emulators that rely on direct methods or look-up tables are often inaccurate and do not respond quickly to changes in both environmental conditions and load variations. A new PV emulator is proposed in this paper. The PV emulator is designed using a model and is supported by binary search computation. The reference current is set by repeatedly solving the single-diode equation. The binary search algorithm is used to obtain the reference current concerning the Maximum Power Point(MPP). From the generated reference current, the reference voltage is calculated. The ProportionalIntegral (PI) controller adjusts the duty cycle of a buck converter immediately to reach the given references. When used instead of regular techniques, the suggested one produces better I-V curves near the MPP, improving the performance in sudden changes while also minimizing the charge ripple. An emulator is designed and tested using actual data from PV modules in Python. The method has been shown to produce accurate results and increase stability, so it is an excellent candidate to simulate PV and test its advanced control system in real time.

Cited by 0

New Variants of Interpolated Binary Search Algorithm

Saliha Ozgungor, Burhan Selçuk, Hakan Kutucu et al. · 2025

In this study, as an alternative to widely used binary search and interpolation search algorithms, the interpolated binary search algorithm previously discussed by Mohammed, Amrahov, and Çelebi (2021) has been revised. Two new strategies are proposed for the selection of the pivot element that divides the search space into two, different from the pivot selection of the interpolated binary search algorithm. In line with the first strategy, the interpolated binary search algorithm has been restructured in order to increase the stability of the algorithm. The second strategy has made it possible to develop a new stable hybrid search algorithm that approaches <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathcal{O}(\lg \lg n)$</tex> time complexity even in the worst-case scenario. The effectiveness of the proposed algorithms has been evaluated by comparing them with search algorithms commonly used in the literature on datasets of different sizes and with various statistical distributions. The findings show that significant performance improvements are achieved in terms of average time complexity.

Cited by 0

An Improved Binary Search Anti-collision Algorithm

LI Bao-sha · 2014

The problem of Multi-tag collision is inevitable in the RFID system so that anti-collision algorithm is the key to realize the tag identification rapidly.In this paper,an improved binary search anti-collision algorithm is proposed based on some related anti-collision algorithm.This algorithm uses collision bits to construct quad tree, which reduces the search times and the amount of transmission information of readers to improve the system efficiency.The experimental results show that the proposed algorithm performs significantly better than the existing anti-collision algorithms.

Cited by 2

Modified Binary Search Algorithm for Duplicate Elements

Phyu Phyu Thwe, Lai Lai Win Kyi · 2014

In computer science, searching an item or data from a large data set efficiently gives a challenging task. A search strategy is a procedure that performs many comparisons. It starts searching for every value starting from the start, so it performs many comparisons but consumes a lot of time. This searching time can be reduced by avoiding searching every time for each value from the start. Binary search is based on this concept. And it gives a very good performance with respect to other algorithms due to its logarithmic time complexity. But, the limitation with the Binary Search (BS) technique is that it can only be used to search for one element in a given list. So this paper tends to extend Binary Search (BS) algorithm to overcome this limitation. On the other hand, Duplicate Element Binary Search (DEBS) algorithm is developed for duplicate elements in a given list with the same time complexity of classical BS algorithm. Applications of these two algorithms are considered together with the book database in an e-library system. This system is implemented by using java programming language and MySQL server.

Cited by 3

Direct binary search (DBS) algorithm with constraints

Kartheek Chandu, Mikel Stanich, Chai Wah Wu et al. · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2013

In this paper, we describe adding constraints to the Direct Binary Search (DBS) algorithm. An example of a useful constraint, illustrated in this paper, is having only one dot per column and row. DBS with such constraints requires greater than two toggles during each trial operation. Implementations of the DBS algorithm traditionally limit operations to either one toggle or swap during each trial. The example case in this paper produces a wrap-around pattern with uniformly distributed ON pixels which will have a pleasing appearance with precisely one ON pixel per each column and row. The algorithm starts with an initial continuous tone image and an initial pattern having only one ON pixel per column and row. The auto correlation function of Human Visual System (HVS) model is determined along with an initial perceived error. Multiple operation pixel error processing during each iteration is used to enforce the one ON pixel per column and row constraint. The constraint of a single ON pixel per column and row is used as an example in this paper. Further modification of the DBS algorithm for other constraints is possible, based on the details given in the paper. A mathematical framework to extend the algorithm to the more general case of Direct Multi-bit Search (DMS) is presented.

Cited by 6

Binary Search Algorithm-Inspired Hybrid Feature Selection

Hakan Gündüz, Şevval Şolpan, Kerem Küçük · Kocaeli Üniversitesi - AVESİS · 2025

Cited by 0