采用線性方式進行折半查找：

Binary_Search(int arr[],int key,int lowIndex,int upperIndex) {int middleIndex = 0;while(lowIndex <= upperIndex){middleIndex = lowIndex + (upperIndex - lowIndex) / 2;if(arr[middleIndex] == key){return middleIndex;}if (key > arr[middleIndex]){lowIndex = middleIndex + 1;}else{upperIndex = middleIndex - 1;}}return -1; }

采用遞歸方式進行折半查找：

Binary_Search_Recursive(int arr[],int key,int lowIndex,int upperIndex) {if (lowIndex <= upperIndex){int middleIndex = lowIndex + (upperIndex - lowIndex) / 2;if(arr[middleIndex] == key){return middleIndex;}else if(arr[middleIndex] < key){lowIndex = middleIndex + 1;Binary_Search_Recursive(arr,key,lowIndex,upperIndex);}else{upperIndex = middleIndex - 1;Binary_Search_Recursive(arr,key,lowIndex,upperIndex);}}else{return -1; } }

轉載于:https://www.cnblogs.com/PerfectSoft/archive/2012/10/03/2711079.html

總結

以上是生活随笔為你收集整理的数据结构——折半查找的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。