关于二次查找算法的,这是按递增排序的
int[] myArray = { 1, 3, 5, 7, 9, 13, 14 };
public int bin_Search(int[] array, int length, int value)
{
int minimum = 0;
int maximum = array.Length;
int middle = maximum / 2;
if (minimum<maximum)
{
if (array[middle]==value)
{
return middle;
}
else if (array[middle]>value)
{
maximum = middle - 1;
middle = (minimum + maximum) / 2;
}
else
{
minimum = middle + 1;
middle = (minimum + maximum) / 2;
}
}
return -1;
}