import java.util.Arrays;/*** 已知数组如下:* int[] arr = {431,54,25,25,26,45,2,4,65,3,64,6,46,7,54};* 1:使用Arrays对数组元素进行排序并打印排序后的结果；* 2:使用二分法查找元素：2，并打印查询结果；* 3:使用二分法查找200，并打印查找结果；*/
public class Demo1 {public static void main(String[] args) {int[] arr = new int[]{431, 54, 25, 25, 26, 45, 2, 4, 65, 3, 64, 6, 46, 7, 54};//1:使用Arrays对数组元素进行排序并打印排序后的结果；/*     Arrays.sort(arr);System.out.println(Arrays.toString(arr));*///冒泡排序bulleSort(arr);System.out.println(Arrays.toString(arr));//二分查找int i = binarySearch(arr, 200);System.out.println(i);}/*** 二分查找** @param arr 二分查找*/private static int binarySearch(int[] arr, int number) {int min = 0;int max = arr.length - 1;int mid = -1;while (min <= max) {mid = (min + max) / 2;if (arr[mid] == number) {System.out.println("找到元素" + number + "索引为" + mid);return mid;} else if (arr[mid] > number) {max = mid - 1;} else if (arr[mid] < number) {min = mid + 1;}}System.out.println("数组中找不到元素" + number);return -1;}/*** 冒泡排序** @param arr 数组*/private static void bulleSort(int[] arr) {int temp = 0;for (int i = 0; i < arr.length; i++) {for (int j = 0; j < arr.length - 1 - i; j++) {if (arr[j] > arr[j + 1]) {temp = arr[j];arr[j] = arr[j + 1];arr[j + 1] = temp;}}}}
}