C++ 折半查找算法实现：在有序数组中查找数字

#include using namespace std;

int main(){ const int N=10; int a[N]={1,2,3,4,5,6,7,8,9,10}; int num; cout'请输入要查找的数字：'; cin>>num; int left=0,right=N-1,mid; while(left<=right){ mid=(left+right)/2; if(a[mid]==num){ cout'找到了，下标为'<<mid<<endl; return 0; } else if(a[mid]<num){ left=mid+1; } else{ right=mid-1; } } cout'未找到'<<endl; return 0; }