Development Binary Search Algorithm Ragheed D. Salim

الملخص

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.