java 折半查找法(二分查找)实例
发布时间:2020-12-14 05:21:46 所属栏目:Java 来源:网络整理
导读:复制代码 代码如下: public class HalfSearch { public static int halfSearch(int a[],int x) { int mid,left,right; left = 0; right = a.length - 1; mid = (left + right) / 2; while (a[mid] != x) { if (x a[mid]) { left = mid + 1; } else if (x a[m
复制代码 代码如下: public class HalfSearch { public static int halfSearch(int a[],int x) { int mid,left,right; left = 0; right = a.length - 1; mid = (left + right) / 2; while (a[mid] != x) { if (x > a[mid]) { left = mid + 1; } else if (x < a[mid]) { right = mid - 1; } mid=(left+right)/2; } return mid; } public static void main(String[] args) { } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |