BinarySearch Method

[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]

Overload List

	Name	Description
	BinarySearch<(Of <T>)>(IList<(Of <T>)>, T, Int32%)	Searches a sorted list for an item via binary search. The list must be sorted by the natural ordering of the type (it's implementation of IComparable<T>).
	BinarySearch<(Of <T>)>(IList<(Of <T>)>, T, IComparer<(Of <T>)>, Int32%)	Searches a sorted list for an item via binary search. The list must be sorted by the ordering in the passed instance of IComparer<T>.
	BinarySearch<(Of <T>)>(IList<(Of <T>)>, T, Comparison<(Of <T>)>, Int32%)	Searches a sorted list for an item via binary search. The list must be sorted by the ordering in the passed Comparison<T> delegate.