Binary Searching involves searching for an element in an array, where the items are arranged in ascending or descending order. That means the entries in the array are sorted. If you want to learn how to write a function that does this, keep reading.
At the moment, I am writing a series of articles concerning database programming for www.devhardware.com. Some recordset APIs are supplied with a Find function; you just use the Find function without knowing how it was written. Other APIs may not have any Find function; this means that you have to write the Find function yourself (when you need one).
Therefore, if you are a database programmer, knowing how to write an efficient Find function is a big plus. In this article, I show you how to write the binarySearch function, which is very efficient for traditional (client side) database programming.
There are other reasons why you would want to understand Find functions, in particular the binarySearchfunction. Maybe you want to write a database programming API. Maybe you did not understand the topic well at your university (or associate degree program). Maybe they did not even cover it at your university. Maybe you are a self-trained programmer and you want to learn more. Maybe you are a teacher or lecturer and you want to get a better understanding of the topic in order to teach it well. Maybe you want to write a Find function for an array of strings, which is not concerned with a database.