Development Binary Search Algorithm

Main Article Content

Ragheed D. Salim

Abstract

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.

Article Details

How to Cite
1.
Development Binary Search Algorithm. Baghdad Sci.J [Internet]. 2011 Jun. 12 [cited 2024 Mar. 29];8(2):625-9. Available from: https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/2557
Section
article

How to Cite

1.
Development Binary Search Algorithm. Baghdad Sci.J [Internet]. 2011 Jun. 12 [cited 2024 Mar. 29];8(2):625-9. Available from: https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/2557

Similar Articles

You may also start an advanced similarity search for this article.