这是冒号排序的代码,当然也可以说是按顺序排序,因为这个走了蛮多遍的,每次比较都是跟相邻的两个数对比,从而剥离出来一个最大的数,这就是冒泡排序 public class Mao { public static void main(String[] args) { int[] arr= {1,2,4,8,5,6,7}; for (int i = 0; i <arr.length-1; i++) { for (int j = 0; j < arr.length-1-i; j++) { if (arr[j] > arr[j+1]) { int temp = arr[j]; arr[j]=arr[j+1]; arr[j+1]=temp; } } } for (int i = 0; i < arr.length; i++) { System.out.println(arr[i]+"\t"); } }
选择循环
public class Mao1 { public static void main(String[] args) { int[] arr= {1,2,4,8,5,6,7,3}; //选择循环 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; } } } for (int i = 0; i < arr.length; i++) { System.out.println(arr[i]+"\t"); } }