JAVA_选择排序、冒泡排序

20171112 选择排序、冒泡排序

//一、选择排序 下标分析

int[] ary = new int[]{8,3,7,2,1,9};

int i;

int j;

for(i=0;i<ary.length-1;i++){

for(j=i+1;j<ary.length;j++){

System.out.println(i);

System.out.println(j);

}

}

下标

01.02.03.04.05

12.13.14.15

23.24.25

34.35

45

//一、选择排序

public class TestClass {

public static void main(String[] args) {

int[] ary = new int[]{8,3,7,2,1,9};

for(int i=0;i<ary.length-1;i++){

for(int j=i+1;j<ary.length;j++){

if(ary[i]>ary[j]){

int temp = ary[i];

ary[i] = ary[j];

ary[j] = temp;

}

}

}

for(int num:ary){

System.out.println(num);

}

}

}

//二、冒泡排序 下标分析

int[] ary = new int[]{8,3,7,2,1,9};

int i;

int j;

for(i=0;i<ary.length-1;i++){

for(j=0;j<ary.length-1-i;j++){

System.out.println(i);

System.out.println(j);

}

}

下标（前位为轮次）

00,01,02,03,04

10,11,12,13

20,21,22

30,31

40

//二、冒泡排序

int[] ary = new int[]{8,3,7,2,1,9};

for(int i=0;i<ary.length-1;i++){

for(int j=0;j<ary.length-1-i;j++){

if(ary[j+1]<ary[j]){

int temp = ary[j];

ary[j] = ary[j+1];

ary[j+1] = temp;

}

}

}

for(int num:ary){

System.out.println(num);

}