A Brief Survey and Examination of Various Searching Techniques

Searching is a traversal technique in the data structure, and it is used to find a particular element in a given list of items. This research paper presents the primary searching algorithm types and analyses their working process, time complexity, space complexity, advantages, disadvantages, and examples. Our study found that hash search is efficient for more significant data items, and exponential search is used for an infinite set of elements. Whereas binary search is suitable for mid - sized data items and applicable for arrays and linked lists, Dependent upon the analysis, a comparative study is being made so that the user can choose the type of searching technique based on the requirement.