![]() Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data structure. In this technique we start at the beginning of the list / array / table / file and search for the desired element by matching the value with each record being. In this type of search, a sequential search is made over all items one by one. It is inefficient and rarely used, but creating a program for it gives an idea about how we can implement some advanced search algorithms. The simplest approach is to go across every element in the data structure and match it with the value you are searching for.This is known as Linear search. Searching is a very basic necessity when you store data in different data structures.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |