1、二分法: //二分法:搜索已排序好的字符串组 #include<iostream> using namespace std; int bisearch(char** arr,int b,int e,char* v) { int minIndex=b,maxIndex=e,midIndex=0; while(minIndex < maxIndex) { midIndex = minIndex + (maxIndex-minIndex)/2; int flag = strcmp(arr[midIndex] , v); if( flag < 0) minIndex = midIndex; else if( flag == 0) return midIndex; else maxIndex = midIndex; } return -1; } int main() { char* arr[] = {"ahello","bthe","cworld","dthanks","eyou","fvery","gmuch","kgdk"}; int sz= sizeof(arr)/4; for(int i=0;i<sz;++i) cout<<bisearch(arr,0,sz,arr[i])<<endl; return 0; } 2、字符串转变成整数 //实现字符串转化成整数 //要求输入:“123445”,字符串里的字符是数字 #includ