数组为升序!前辈高人们指点一二 Code: int Location(int *p,int m,int n) //p为指向数组的指针,m为数组长度,n是要查找的数 { int low=0,high=m-1,mid; mid=(low+high)/2; for(;n!=p[mid];) { if(n>p[mid]) mid=(low+high)/2; low++; if(n<p[mid]) high--; } return mid+1; }