Java 排序算法性能对比 Array工具类的使用

排序算法性能对比

冒泡排序n平方

各种内部排序方法性能比较

Array工具类的使用

package project01;

//java.util.Arrays:操作数组的工具类，里面定义了很多操作数组的方法

import java.util.Arrays;

public class ArraysTest {
    public static void main(String[] args) {
        //1.boolean equals(int[] a,int[] b):判断两个数组是否相等
        int[] arr1 = new int[]{1,2,3,4};
        int[] arr2 = new int[]{1,3,2,4};
        boolean isEquals = Arrays.equals(arr1,arr2);
        System.out.println(isEquals);
        //2.String toString(int[] a ):输出数组信息
        System.out.println(Arrays.toString(arr1));///[1, 2, 3, 4]
        //3.void fill(int[] a, int val):将指定值填充到数组中
        Arrays.fill(arr1,10);
        System.out.println(Arrays.toString(arr1));//[10, 10, 10, 10]
        //4.void sort(int[] a )：对数组进行排序
        Arrays.sort(arr2);
        System.out.println(Arrays.toString(arr2));//[1, 2, 3, 4]
        //5.int binarySearch(int[] a,int key):索引位置
        int[] arr3 = new int[]{-95,20,65,0,-32,-85,25,62,2536};
        int index1 = Arrays.binarySearch(arr3,25);
        System.out.println(index1);//6
        int index2 = Arrays.binarySearch(arr3,34);
        System.out.println(index2);//-8，负数未找到
    }
}

结果

false
[1, 2, 3, 4]
[10, 10, 10, 10]
[1, 2, 3, 4]
6
-8

Process finished with exit code 0