AN INDEXED SEQUENTIAL SEARCH AND ITS COMPARATIVE ANALYSIS WITH BASIC SEARCHING TECHNIQUES

The data and file structures need the techniques to perform searching or locating operation of elements. In the data structure, list can be sorted or unsorted. Depending upon sorting, different searching algorithms are evolved. In this paper Indexed Sequential Search is studies and compared with basic searching techniques such as Linear Search and Binary Search. These techniques are reviewed with working of the three techniques and their comparison analysis with respect to time and space complexity and finally the basic implementation using C programming. Keywords— searching, linear search, binary search, indexed sequential search, time and space complexity