A brief study and analysis of different searching algorithms

This paper presents the review of certain important and well discussed traditional as well as proposed search algorithms with respect to their time complexity, space Complexity, merits and demerits with the help of their realize applications. This paper also highlights their working principles. As it is well known that every sorted or unsorted list of elements requires searching technique so many search algorithms have been invented. Among traditional search algorithms, a comparison table has been made in order to check and establish their benefits and drawbacks. Among some of the well known proposed search algorithms like fast string searching algorithm, multiple solution vector approach and bi linear search etc, a comparison has also been made.