java基础 冒泡选择排序

冒泡排序

int[]arr = {3,9,1,2,8,4,7,6};
		int temp = 0;
		for (int i = 0; i < arr.length-1; i++) {//i代表轮次
			for (int j = 0; j < arr.length-i-1; j++) {
				if(arr[j]>arr[j+1]){
					//交换
					temp = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = temp;
				}
			}
		}

		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]+" ");
		}

选择排序

int[]arr = {3,2,5,4,9,1,7,6  };
		int temp;
		for (int i = 0; i < arr.length-1; i++) {//i代表伦次
			for (int j = i+1; j < arr.length; j++) {
				if(arr[i]>arr[j]){
				temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
				}
			}
		}
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]+" ");
		}