排序&查找

 冒泡排序   选择排序

public class ArrayList {

	public static void main(String[] args) {
		// 排序：选择排序  冒泡排序
		
		int[] arr = {2,32,43,243,0,56};
		bubbleSort(arr);
		for(int i = 0;i<arr.length;i++) {
			System.out.println("bubbleSort"+arr[i]);
		}
		System.out.println("========================================");
		int[] arr2 = {2,32,43,243,0,56,47,82};
		selectSort(arr2);
		for(int i = 0;i<arr2.length;i++) {
			System.out.println("selectSort"+arr2[i]);
		}
		
		
		
		
	}
	
	//冒泡排序
	public static void bubbleSort(int[] arr) {
		for(int i=0;i<arr.length-1;i++) {//控制的是整体的次数
			for(int j=0;j<arr.length-1-i;j++) {//确定一个元素需要比较的次数
				if(arr[j]>arr[j+1]) {//交换
					arr[j] = arr[j]^arr[j+1];
					arr[j+1] = arr[j]^arr[j+1];
					arr[j] = arr[j]^arr[j+1];
				}
			}
		}
	}
	
	//选择排序
	public static void selectSort(int[] arr) {
		for(int i=0;i<arr.length-1;i++) {//控制的是整体的次数
			for(int j=i;j<arr.length-1;j++) {//确定一个元素需要比较的次数
				if(arr[i]>arr[j+1]) {//交换
					arr[i] = arr[i]^arr[j+1];
					arr[j+1] = arr[i]^arr[j+1];
					arr[i] = arr[i]^arr[j+1];
				}
			}
		}
		
	}
}

查找

public class ArraySeach {
	public static void main(String[] args) {
		//查找
		//遍历查找
		int[] arr = {2,32,1,56,564,24,30};
		int result= search(arr,564);
		System.out.println(result);
		//二分查找
		int[] arr1 = {88,2,32,1,56,564,24,30};
		int result1= search(arr1,88);
		System.out.println(result1);
		
	}
	//遍历查找
	public static int  search(int[] arr,int key) {
		for (int i=0;i<arr.length;i++) {
			if (key==arr[i]) {
				return i;//将下标返回
			}
		}
		return -1;
	}

	//二分查找
	public static int binarySearch(int[] arr,int key){
		int left = 0;
		int right = arr.length-1;
		while(left<=right) {
			int mid = (left+right)/2;
			if(arr[mid]==key) {
				return mid;
			}else if(arr[mid]>key){
				right = mid -1;
			}else if(arr[mid]<key) {
				left = mid +1;
			}
		}
		return -1;
	
	}
}