Binary Search Algorithm
MODULE NAME: Binary_Search
INPUT : Integer array called 'arr', size AS integer, value AS integer
OUTPUT : index or -1
PROCESS :
start = 0
stop = size - 1
WHILE stop >= start DO
i = (start + stop) / 2
IF value == arr[i] THEN
RETURN i
ELSE
IF value > arr[i] THEN
start = i + 1
ELSE
stop = i - 1
ENDIF
ENDIF
ENDWHILE
RETURN -1
ENDMODULE
BINARY SEARH DIAGRAM - USING BIANRY SEARCH TREE
HOMEWORK ASSIGNMENT
int arr[13] = {16, 17, 18, 19, 20, 30, 31, 32, 33, 34, 40, 41, 42};
Draw the binary search tree for each:
a) 33
b) 16
c) 30
d) 41
