Abstract

Searching finds wide application in computer systems and till date, it remains one of the most fundamental operation. The need for evolving searching algorithm is never ending. This paper focuses on proposing a new algorithm namely Equipartition search algorithm and compares this method to existing methods by searching in various sequences. Results have been compiled by taking running time as a major parameter. As evident from the results, the Equipartition search method performs better than compared algorithms for several distributions. Hence the proposed method helps to reduce the running time in searching operation.

References

• Jiang Z, Li J. A tag feedback based sorting algorithm for social search. InSystems and Informatics (ICSAI), 2012 International Conference on 2012 May 19 (pp. 1482-1485). IEEE.
• Li Z, Zhang C, Hu Y. Backwards Search Algorithm of Double-Sorted Inter-relevant Successive Trees. In2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery 2008 Oct 18.
• Horowitz E, Sahni S. Fundamentals of computer algorithms. Computer Science Press; 1978.
• Asagba PO, Osaghae EO, Ogheneovo EE. IS BINARY SEARCH TECHNIQUE FASTER THAN LINEAR SEARCH. Scientia Africana. 2010 Dec;9(2):83-92.
• Knuth DE. The art of computer programming: sorting and searching. Pearson Education; 1998.
• Cormen TH. Introduction to algorithms. MIT press; 2009 Jul 31.
• Weisstein EW. Binary Search. From MathWorld—A Wolfram Web Resource.
• Knuth DE. TheArt ofComputerProgramming, vol. 3.
• Peterson WW. Addressing for random-access storage. IBM journal of Research and Development. 1957 Apr 1;1(2):130-46.
• Gonnet GH. Interpolation and interpolation hash searching. Canada: University of Waterloo; 1977 Feb.
• Yao AC, Yao FF. The complexity of searching an ordered random table. InFoundations of Computer Science, 1976., 17th Annual Symposium on 1976 Oct 25 (pp. 173-177). IEEE.
• Perl Y, Itai A, Avni H. Interpolation search—a log log N search. Communications of the ACM. 1978 Jul 1;21(7):550-3.
• Gonnet GH, Rogers LD, George JA. An algorithmic and complexity analysis of interpolation search. Acta Informatica. 1980 Jan 1;13(1):39-52.
• Mehlhorn K, Tsakalidis A. Dynamic interpolation search. Journal of the ACM (JACM). 1993 Jul 1;40(3):621-34.
• Andersson A, Mattsson C. Dynamic Interpolation Search in o (log log n) Time. InInternational Colloquium on Automata, Languages, and Programming 1993 Jul 5 (pp. 15-27). Springer Berlin Heidelberg.
• Santoro N, Sidney JB. Interpolation-binary search. Information processing letters. 1985 May 10;20(4):179-81.
• Ferguson DE. Fibonaccian searching. Communications of the ACM. 1960 Dec 1;3(12):648.
• Shneiderman B. Jump searching: a fast sequential search technique. Communications of the ACM. 1978 Oct 1;21(10):831-4.