package Algorithm.binarysearchnorecursion;public class BinaaySearchNoRecur {public static void main(String[] args) {int arr [] = {1,2,3,4,5};int b = binarySearch(arr, 0);System.out.println(b);}//二分查找的非遞歸實現public static int binarySearch(int [] arr, int target){int left = 0;int right = arr.length - 1;boolean flag = true;while(left <= right){int mid = (left + right) / 2;if (target == arr[mid]){return mid;}if (target > arr[mid]){left = mid + 1;}else {right = mid - 1;}}return -1;} }

總結

以上是生活随笔為你收集整理的算法 - 二分查找(非递归实现二分查找)的全部內容，希望文章能夠幫你解決所遇到的問題。

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