Linear Search and binary Search

1. TOPIC - Linear And Binary Search

2. LINEAR SEARCH
A linear search is also known as a sequential search
that simply scans each element at a time.
The linear search starts searching from the first
element and compares each element with a searched
element till the element is not found.

3.  In a linear search, the elements don't need to be
arranged in sorted order.
 If the number of elements increases, the number of
elements to be scanned is also increased.
 We can say that the time taken to search the
elements is proportional to the number of elements.

4. ALGORITHM
Linear Search (Array A, Value x)
Step 1: Set i to 1
Step 2: if i > n, then jump to step 7
Step 3: if A[i] = x then jump to step 6
Step 4: Set i to i + 1
Step 5: Go to step 2
Step 6: Print element x found at index i
and jump to step 8
Step 7: Print element not found
Step 8: Exit

5. EXAMPLES

6. BINARY SEARCH

7. ALGORITHM
Binary_Search(a, lower_bound, upper_bound, val) // 'a' is the given array, 'lower_bound' is the
index of the first array element, 'upper_bound' is the index of the last array element, 'val' is
the value to search
 Step 1: set beg = lower_bound, end = upper_bound, pos = - 1
 Step 2: repeat steps 3 and 4 while beg <=end
 Step 3: set mid = (beg + end)/2
 Step 4: if a[mid] = val
set pos = mid
print pos
go to step 6
else if a[mid] > val
set end = mid - 1
else
set beg = mid + 1
[end of if]
[end of loop]
 Step 5: if pos = -1
print "value is not present in the array"
[end of if]
 Step 6: exit

8. EXAMPLES

11. BINARYSEARCH
LINEARSEARCH