티스토리 뷰
public static int BinarySearch( int[] array, int target ) { int min = 0; int max = array.length - 1; while (min != max) { int mid = ( min + max ) / 2; if ( array[ mid ] == target ) return mid; else if ( array[ mid ] > target ) max = mid - 1; else if ( array[ mid ] < target ) min = mid + 1; } return -1; }
'[Algorithm]' 카테고리의 다른 글
MergeSort (0) | 2011.09.18 |
---|---|
Linear Search (0) | 2011.09.02 |