modified binary search: search in sorted array for elements which "surround" float p directly
e.g. (0.0f 0.1f 0.2f 0.3f) and binarySearch(0.15f) returns 1

p: float value to search for
A: float array
n: size of A

Assumptions:
- array is sorted in ascending order
- A[0] < p < A[n-1] guaranteed

Code:

i=floor((n-1)/2)
while(! (array[i] < position && array[i+1] > position) ) {
	if(! (array[i] < position) )
		i=floor(i/2);
	else if(! (array[i+1] > position) )
		i+=floor(i/2);
}
return i;