基本排序

选择排序

		
int[] arr = {4,5,9,0,12,1,3,8,6};
		for(int i=0;i<arr.length-1;i++){
			int temp = arr[i];
			int smallerLocation = i ;
			for(int j=i+1;j<arr.length;j++){
				if(arr[j]<arr[i]){
					temp = arr[j];
					smallerLocation = j;
				}
			}
			arr[smallerLocation] = arr[i];
			arr[i] = temp;
		}

冒泡排序

		int[] arr = {4,5,9,0,12,1,3,8,6};
		for(int i=0;i<arr.length-1;i++){
			for(int j=i+1;j<arr.length;j++){
				if(arr[i]>arr[j]){
					int temp = arr[i];
					arr[i] = arr[j];
					arr[j] = temp;
				}
			}
		}

冒泡排序（原型）

		int[] arr = {4,5,9,0,12,1,3,8,6};
		for(int t=0;t<arr.length-1;t++){
		   for(int i=0;i<arr.length-1;i++){
			int j = i+1;
			if(arr[i]>arr[j]){
				int temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		    }
		    for(int k=0;k<arr.length;k++){
			System.out.print(arr[k]+",");
		    }
		    System.out.println();
		}