algorithms python data structures searching is very basic necessity when you store data in different data structures 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 it is inefficient and rarely usedbut creating program for it gives an idea about how we can implement some advanced search algorithms linear search in this type of searcha sequential search is made over all items one by one every item is checked and if match is found then that particular item is returnedotherwise the search continues till the end of the data structure def linear_search(valuessearch_for)search_at search_res false match the value with each data element while search_at len(valuesand search_res is falseif values[search_at=search_forsearch_res true elsesearch_at search_at return search_res [ print(linear_search( )print(linear_search( )when the above code is executedit produces the following resulttrue false interpolation search this search algorithm works on the probing position of the required value for this algorithm to work properlythe data collection should be in sorted form and equally distributed initiallythe probe position is the position of the middle most item of the