摘要 : Due to the large amount of data storage requirements in computer science now a day, the data must be searched and retrieved in an efficient way. For this, the data can be viewed be organized in a different way or using different d... 展开 Due to the large amount of data storage requirements in computer science now a day, the data must be searched and retrieved in an efficient way. For this, the data can be viewed be organized in a different way or using different data structures. In this paper a short discussion is given on different searching algorithms and proposed a new simple key search algorithm for interpolation search method. The algorithm that we developed can be referred by the name Expeditious Search Algorithm. It is a simple key searching algorithm which uses divide and conquer technique method. It is a kind of interpolation algorithm. The basic idea of Expeditious Search Algorithm is based on binary search technique. Expeditious Search Algorithm requires the input array in sorted form. The array is divided based on some conditions and any one of the partition is selected for searching the key and all the other sub parts are discarded. This procedure repeats. The algorithm takes the average case time of O(log log n). 收起