字符串的快速排序和二分查找
string Binary_search(string a,string *b,int begin,int end){if((begin==end-1)&&a!=b[(begin+end)/2]){return "no result";}else if(a>b[(begin+end)/2]){return Binary_search(a,b,(begin+end)/2,end);}else if(a<b[(begin+end)/2]){return Binary_search(a,b,begin,(begin+end)/2);} else{return b[(begin+end)/2];}}