//CIS 610-251: Data Structures and Algorithms
//Assignmnet # 3Question #3
//Use binary search to find integers in integer array

Let, 
a[]=1,3,7,15,21,22,36,78,95,106

Binary serach function takes following arguments:
1. Array 
2. Integer to be found
3. Low array element
4. High array element

1)Finding 1 in array a[]
binsrch(a,1,0,9) 
---------------------------------------------------------
recursion	low	high	 mid	a[mid]
---------------------------------------------------------
1	0	9	4	21
	0	3	1	3
3	0	0	0	1


2)Finding 98 in array a[]
binsrch(a,98,0,9)
---------------------------------------------------------
recursion	low	high	 mid	a[mid]
---------------------------------------------------------
1	0	9	4	21
	5	9	7	78
3	8	9	8	95
4	9	9	9	106

finally returns -1