数据结构与算法：C-PHP二分查找实现

C语言实现：//二分查找的c语言实现#includeintbinarySearch(int*p,intsize,inttarget){intleft=0;int右=大小-1;intmid=(左+右)/2;while(left<=right){mid=(left+right)/2;if(p[mid]==target){returnmid;}else{if(p[mid]>target){right=mid-1;}else{左=左+1;}}}return-1;}intmain(){intnums[12]={0,1,2,3,4,5,6,7,8,9,100,200};intsize=sizeof(nums)/sizeof(nums[0]);intres=binarySearch(nums,size,100);printf("res:%d\n",res);return0;}PHP实现：//PHP二分查找//这里使用了PHP7的强类型语法函数index(array$nums,int$target):int{$left=0;$len=计数($nums);$right=$len-1;$ans=-1;while($left<=$right){$mid=floor(($left+$right)/2);如果（$target==$nums[$mid]）{return$mid;}埃尔斯eif($target>$nums[$mid]){$left=$mid+1;}else{$right=$mid-1;}}返回$ans;}