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
Keep in mind that binary search can be quite inefficient for some list implementations. For example, for a linked list it is O(n) if you implement it correctly, and O(n log n) if you implement it naively.