冒泡排序20170919
package Tuesday;
import java.util.Arrays;
import java.util.Collections;
public class TestWork {
public static Integer []array={2,45,78,32,45,75,99,103,254};
//冒泡排序:
public void sort(){
//两个for循环来比较临近数字大小:
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array.length-i-1; j++) {
if(array[j]>array[j+1]){
int temp=array[j]; //定义一个变量用作交换值,两两比较值大的往后排;
array[j]=array[j+1];
array[j+1]=temp;
}
}
System.out.println(array[i]);
}
}
public static void main(String[] args) {
//用sort方法实现升序:
Arrays.sort(array);
for (int i = 0; i < array.length; i++) {
System.out.println(array[i]);
}
//倒序输出:
Arrays.sort(array,Collections.reverseOrder());
for (int i = 0; i < array.length; i++) {
System.out.println(array[i]+",");
}
}
}