java算法之查找某个元素在数组中的位置
//一般思路:先排序再二分查找public class BinarySearch { public static void main(String [] args){ int a [] = {1,2,5,9,12,30,4,3,8}; selectSort(a); int i = 12; int pos = binarySearch(a, i); System.out.println(); Syst
原创
2020-09-11 19:12:27 ·
3460 阅读 ·
0 评论