DefinePK

Abstract

This paper introduces a fast searching technique for multiple values to
be searched which is even faster than the binary search. In this technique,
a sorted list of values can be searched from another sorted list very
efficiently as compared to other existing searching techniques specifically
binary search algorithm. The overall time for sorting the values to be
searched and searching is less than the time taken by the binary search.
In this technique, the size of targeting list is reduced for every next
value to be searched. As a result the searching time of remaining values
to be searched is reduced, while in binary search the size of target list
remains same for every value to be searched. In other words, we can
say that the targeting list is traversed completely each time for every
value to be searched from beginning to end. So binary search takes
more time than the Multiple Values Search Algorithm (MVSA)...