Binary Search

Question 1

Step 1

Answer 1

Read the search element from the user

Question 2

Step 2

Answer 2

Find the middle element in the sorted list

Question 3

Step 3

Answer 3

Compare, the search element with the middle element in the sorted list.

Question 4

Step 4

Answer 4

“If both are matching, then display ““Given element found!!!”” and terminate the function”

Question 5

Step 5

Answer 5

If both are not matching, then check whether the search element is smaller or larger than middle element.

Question 6

Step 6

Answer 6

If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left sub-list of the middle element.

Question 7

Step 7

Answer 7

If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right sub-list of the middle element.

Question 8

Step 8

Answer 8

Repeat the same process until we find the search element in the list or until sub-list contains only one element.

Question 9

Step 9

Answer 9

“If that element also doesn’t match with the search element, then display ““Element not found in the list!!!”” and terminate the function.”