THIS FUNCTION SEARCHES AN INTEGER ARRAY USING RECURSIVE 
BINARY SEARCH
*/

int binSearch(int array[], int element, int first, int last)
{
	int mid;					//ARRAY MIDPOINT
	if (first > last)	//IF ELEMENT NOT IN ARRAY
		return -1;			//RETURN -1, ELSE CONTINUE
	else
	{
		mid = (first + last) / 2;   //FIND MIDPOINT OF ARRAY
	  if (element == array[mid])	//IF ELEMENT IS IN ARRAY[MID]
				return mid;	            //RETURN MID
    else				                //ELSE SEARCH APPROPRIATE HALF
       	if (element < array[mid])
			     return binSearch(array, element, first, mid - 1);
		    else
           return binSearch(array, element, mid + 1, last);
	} //END OUTER ELSE