冒泡排序与选择排序的实现

冒泡排序

int[] arr = {5,0,8,6,9,3,2,1};
/**
  * 冒泡排序
  */
 for (int i = 0; i < arr.length-1; i++) {
     //两两比较 
     for (int j = 0; j < arr.length - 1; j++) {
         if(arr[j] > arr[j+1]){
             int temp = arr[j];
             arr[j] = arr[j+1];
             arr[j+1] = temp;
         }
     }
 }
 System.out.println(Arrays.toString(arr));

选择排序

int[] arr = {5,0,8,6,9,3,2,1};
/**
 * 选择排序
*/
for (int i = 0; i <arr.length; i++) {
    int index = i;
    //获取最小值的下标
    for (int j = i+1; j < arr.length; j++) {
        if(arr[index] > arr[j]){
            index = j;
        }
    }
    //将最小值替换到首位
    int temp;
    temp = arr[i];
    arr[i] = arr[index];
    arr[index] = temp;
}
System.out.println(Arrays.toString(arr));