JavaSE：Arrays类

续：
闲扯一句毒鸡汤：相信美好的事物即将发生！
咳咳咳。。。。步入主题：
数组Arrays类方法实现：
1.equals方法

    public class EqualsMothod {
	public static boolean equals(int[] arr1, int[] arr2) {
		if (arr1 == arr2) {
			return true;
		}
		if (arr1 == null || arr2 == null) {
			return true;
		}
		if (arr1.length != arr2.length) {
			return false;
		}
		for (int i = 0; i < arr1.length; i++) {
			if (arr1[i] != arr2[i]) {
				return false;
			}
		}
		return true;
	}
	public static void main(String[] args) {
		int[] numbers = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
		int[] number = { 1, 2, 3, 4, 5, 6, 7, 8 };
		boolean c = equals(numbers, number);
		System.out.println(c);
		System.out.print(Arrays.equals(numbers, number) + " ");
		}
	}

2.二分法binarySearch()

	public static int binarySearch1(int[] a, int key) {
		int min = 0, max = a.length - 1;
		while (true) {
			int mid = (min + max) / 2;
			if (a[mid] > key) {
				max = mid - 1;
			} else if (a[mid] < key) {
				min = mid + 1;
			} else {
				return mid;
			}
			if (min > max) {
				return -1;
			}
		}

	}
	public static void main(String[] args) {
		int[] a = { 11, 22, 33, 33, 44 };
		int b = binarySearch1(a, 22);
		System.out.println(b);
		System.out.println(Arrays.binarySearch(a, 22));
	}

3.冒泡排序sort

	public static void sort1(int[] a) {
		for (int i = 0; i < a.length; i++) {
			boolean b = true;
			for (int j = 0; j < a.length - 1 - i; j++) {
				if(a[j]>a[j+1]){
				int temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;
				b = false;
				}
			}
			if (b) {
				break;
			}
		}
	}

	public static void main(String[] args) {
		int[] arr = { 12, 33, 22, 11, 44 };
		sort1(arr);
		for (int c : arr) {
			System.out.print(c + " ");
		}
		//Arrays.sort(arr);
	}