International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 48 | Number 1 | Year 2017 | Article Id. IJCTT-V48P119 | DOI : https://doi.org/10.14445/22312803/IJCTT-V48P119

Rational Search Algorithm

Raj Asha

Citation :

Raj Asha, "Rational Search Algorithm," International Journal of Computer Trends and Technology (IJCTT), vol. 48, no. 1, pp. 93-95, 2017. Crossref, https://doi.org/10.14445/22312803/IJCTT-V48P119

Abstract

The Rational Search algorithm is a searching algorithm used to search for a particular element in an array. The array should be sorted in ascending order for using the algorithm. The Rational Search algorithm works in a similar manner as a human would search a word in a dictionary by directly jumping in the part where there is a high chance of finding the required item. It outperforms linear search as well as binary search when the data items in the array are approximately uniformly distributed, that is, the difference between any two adjacent elements are approximately the same for any other two adjacent elements in the array. Otherwise its performance is equivalent to a linear search algorithm.

Keywords

Search Algorithm, Rational Search Algorithm, Searching.

References

[1] Linear search algorithm, https://en.wikipedia.org/wiki/Linear_search
[2] Binary search algorithm, https://en.wikipedia.org/wiki/Binary_search_algorithm
[3] Knuth, Donald (1998). Sorting and Searching. The Art of Computer Programming. 3 (2nd ed.).
[4] Uniform distribution (continuous), https://en.wikipedia.org/wiki/Uniform_distribution_(continuous)
[5] Time Complexity, https://en.wikipedia.org/wiki/Time_complexity
[6] Alfred V., Aho J., Horroroft, Jeffrey D.U. (2002) Data Structures and Algorithms.