Simple question - given an IList how do you perform a binary search without writing the method yourself and without copying the data to a type with bui
Note that there is a bug in the implementation provided by Antoine below: when searching for an item greater than any in the list. The return value should be ~lower not ~middle. Decompile method ArraySortHelper.InternalBinarySearch (mscorlib) to see the framework implementation.