bin search.c

int binarySearch(int *a, int start, int end, int value) {
	if ((end-start) <= 1) {
		//base case
		return -1;
	}

	int cursor = start + (end - start) / 2;

	if (a[cursor]>value) {
		return binarySearch(a, start, cursor, value);
	}
	else if(a[cursor]<value) {
		return binarySearch(a, cursor, end, value);
	}
	else if (a[cursor] = value) {
		return cursor;
	}

}