A9 - SEARCHING

(a)   is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. 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 collection.

Step in Linear Search. This step is set i to 1

(a)  

Step in Linear Search. This step seeks if i > n then go to step 7

(a)  

Step in Linear Search. This step seeks if A[i] = x then go to step 6 

(a)  

Step in Linear Search. This step is set i to i + 1

(a)  

Step in Linear Search. This step goes back to Step 2

(a)  

Step in Linear Search. This step prints Element x Found at index i and go to step 8

(a)  

Step in Linear Search. This step prints element not found

(a)  

Step in Linear Search. This step is the last step, where it only shows an "exit"

(a)  

(a)   is a fast search algorithm with run-time complexity of Ο(log n). This search algorithm works on the principle of divide and conquer. For this algorithm to work properly, the data collection should be in the sorted form.