name_javahadoop的博客

public static void main(String[] args) { Integer[] arr = new Integer[]{12,15,20,36,45,66,72,81,90}; int des = 22; int search = binarySearch(arr, des); System.out.println(search); int recurs

public static void main(String[] args) { Integer[] a = {11,23,65,77,98}; Integer[] b = {22,42,64,72,79}; Integer[] c = new Integer[a.length+b.length]; merge(a, b, c); System.out.println("

/** * 冒泡排序 时间复杂度 O(n^2) * * @param art * @return */ private static Integer[] bubbleSort(Integer[] art){ for (int i = 0; i < art.length; i++) { for(int j = i+1 ;

public static void main(String[] args) { // 定义无序数组 Integer[] arr = new Integer[]{12,14,56,89,11,66,99,3,6,34}; // 插入排序前 System.out.println("插入排序前"); Arrays.asList(arr).forEach(e -> System.ou

/** * @author yaoxin * @date 2018/7/30上午11:04 */public class CoordinateTest { public static void main(String[] args) { // 多边形经度数组 double[] lon = {113.314882,113.355845,113.37...