c# 二分查找

using System;

int [ ] array = { 0, 6, 7, 12, 78, 199, 20 }

int max, min, mid, isIndex;

max = array.Length-1;

min = 0;

isIndex = -1;

while ( min <= max ) {

mid = ( max + min ) / 2;

if ( array[mid] == n ) {

isIndex = mid;

break;

} 

else if ( array[mid]>n ) {

max = mid - 1;

}

else {

min = mid + 1;

}

}

Console.WriteLine( isIndex );