Abstract:- Searching is an important operation in data structure helps to find specific data within a collection of data.Searching algorithms helps us in the retrieval of information which is stored within some data structures such as arrays, linked list and trees. Searching is a process of finding an element in the given list.Number of searching algorithms are available, here we have to find which algorithm is best suited according to the situation.This paper gives detailed study of how searching algorithm works and give their performance analysis with respect to time complexity.
Keywords: Linear search, Binary search, Data Structure
|
DOI:
10.17148/IJARCCE.2024.13506
