A New Algorithm for Fast Data Searching-An Imagination based Indexed Data Searching Technique

In this paper, I have proposed a fast searching algorithm for data stored on index bases. In general in most of the practical real time situations, it gives fast result for all elements belong to the set(array), which is always less than to Omega(log (n)) means takes less time in comparison to Binary search, B-Tree Search, AVL Tree Search etc.., which takes Big Oh O(log (n)) and Omega(log(n)) time for half of the element in array. Here I uses an imaginary(self-assumed) array based on starting and last indexed element and total number of elements in an array, which is applied in formulas with element to be searched and it suggests an index for that data/element, which is mostly more near to that element in comparison to above compared algorithms.