DESIGNING AND IMPLEMENTING DATA STRUCTURE WITH SEARCH ALGORITHM TO SEARCH ANY ELEMENT FROM A GIVEN LIST HAVING CONSTANT TIME COMPLEXITY

Search process is fundamental in computer science. To search an element various data structure are developed and implemented. Searching a word from a dictionary requires alphabetical arrangement of the words for fast searching. To search a record from a database an SQL query with WHERE clause is useful. To search specific information from internet, search engine is widely used. Searching is weaved centrally in almost all computer applications. This research paper is designed with available different search techniques and its time complexity. Various data structures are available with specific application needs. Linear search, binary search, binary search tree, hashing techniques and many other search techniques are studied and then prepared a hybrid data structure involving linked list with an array to directly locate an element. The process actually does not involve any searching technique to search element by comparison but using indexed organization of data structure makes it possible to determine whether an element exists in a list or not. The model is designed to prepare a data structure suitable for fast searching. Direct search can also be implemented using hashing techniques involving some mathematical computation to search any element in a constant time. Similarly, here is an effort is being made to search any element from a given list with constant time involving no mathematical computation to search a key like hashing technique. At last paper is concluded with limitations and future enhancement of the proposed technique.