Discuss / Java / 冒泡排序

冒泡排序

Topic source

Wearezed

#1 Created at ... [Delete] [Delete and Lock User]
import java.util.Arrays;public class test {    public static void main(String[] args) {        /*int[] ns = { 1, 4, 9, 16, 25 };        for (int i=0; i<ns.length; i++) {            int n = ns[i];            System.out.println(n);        }*/        int[] ns = {28, 12, 89, 73, 65, 18, 96, 50, 8, 36};        // 排序前:        System.out.println(Arrays.toString(ns));        for (int i = 0; i < ns.length; i++) {            for (int j = 0; j < ns.length - 1; j++) {                if (ns[j] < ns[j + 1]) {                    int tmp = ns[j];                    ns[j] = ns[j + 1];                    ns[j + 1] = tmp;                }            }        }        System.out.println(Arrays.toString(ns));    }}

  • 1

Reply