•SEARCHING IS ONE OF THE BASIC OPEARTIONS WHICH CAN BE CARRIED ON ARRAY.
•Searching is the process of finding some particular element in the list .
• If the element is present in the list, then the process is called successful otherwise the search is called unsuccessful.
Linear search is the simplest searching technique and often called sequential search. In this type of searching, searching of items begins from the start of an array, till end of the array.
Binary search is the search technique which works efficiently on the sorted lists. Hence, in order to search an element into some list by using binary search technique, we must ensure that the list is sorted.
to learn implementation of linear and binary searching you must watch this recorded lecture.