A project on Binary search. It basically is a faster way to search for numbers in a list. The normal way is called linear search, which searches for numbers 1 by 1. Binary search basically divides the list into 2 parts, from the middle until the number is found. But the list has to have values in ascending order For more information please research. Run in turbo mode for fastest results.
Thanks to my programming sir, Dr Dasgupta, who taught me what is Binary Search and how it works.
