BINARY SEARCH

MID VALUE OF SORTED ARRAY IS TAKEN. IF IT IS GREATER THAN SEARCH CRITERIA , MID VALUE OF LEFT HALF PORTION IS TAKEN ELSE MID VALUE OF RIGHT HALF PORTION IS CONSIDERED. THIS PROCESS IS REPEATED UNTIL SEARCH VALUE IS FOUND. BINARY SEARCH IS MUCH FASTER THAN SEQUENTIAL PROCESS.