Re: Binary search with timestamps

Hmmm, a slight modification seems to work!
Just what I was looking for.



template <class T> long binary_search
	(double t,T *array,long count)
{
	//handle trivial cases:
	if (count<2) return -1;
	if (count==2) return 0;
	if (t<array[0].time)
		return 0;
	if (t>array[count-2].time)
		return count-2;
	
	//binary search:
	long top=count-2;
	long bottom=0;
	for(;;)
	{
		long mid=(top+bottom)/2;
		if (t>array[mid].time && t<=array[mid+1].time)
			return mid;
		else if (t>array[mid+1].time)
			bottom=mid;
		else //if (t<=array[mid].time)
			top=mid;
	}
}