Discuss / Java / 冒泡排序练习

冒泡排序练习

Topic source
import java.util.Arrays;public class ArrayControl {    public static void main(String[] args) {        int[] ns = {12, 9, 32, 36, 22, 87, 56, 99, 27, 66, 55};        //排序前:        System.out.println("排序前:" + Arrays.toString(ns));        //升序排序后:        Arrays.sort(ns);        System.out.println("升序排序后:" + Arrays.toString(ns));        //使用冒泡排序法进行降序排列:        for (int i = 0; i < ns.length - 1; i++) {            for(int j=0;j<ns.length-i-1;j++){                if (ns[j] < ns[j + 1]) {                    int tmp = ns[j + 1];                    ns[j + 1] = ns[j];                    ns[j] = tmp;                }            }        }        //降序排序后:        System.out.println("降序排序后:"+Arrays.toString(ns));    }}

  • 1

Reply