摘要：
int binarysort(int begin , int end , int target){ if ( begin >end ) return -1 ; int middle = (begin + end ) >>1; if ( arr[middle ] == target ) return middle; else if ( target > arr[middle]) binarysort( middle +1 , end, target); else ... 阅读全文
