Discuss / Java / 学语法
Back

学语法

Topic source

_崔先生_

#1 Created at ... [Delete] [Delete and Lock User] 
public static void main(String[] args) {        int temp;//        冒泡排序1        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 -2; i++){            for (int j = 0;j < ns.length-1-i; j++){                if(ns[j] < ns[j+1]){                    temp = ns[j];                    ns[j] = ns[j+1];                    ns[j+1] = temp;                }            }        }        System.out.println(Arrays.toString(ns));        System.out.println(Arrays.toString(ns).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]"));////////////////////////////////////////////////////////////////////////////////////////////////////////////        冒泡排序2        ns = new int[]{ 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };        System.out.println(Arrays.toString(ns));        for(int i= ns.length - 1;i > 0; i--){            for (int j = 0;j < i; j++){                if(ns[j] < ns[j+1]){                    temp = ns[j];                    ns[j] = ns[j+1];                    ns[j+1] = temp;                }            }        }        System.out.println(Arrays.toString(ns));        System.out.println(Arrays.toString(ns).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]"));//////////////////////////////////////////////////////////////////////////////////////////////////////////        选择排序        ns = new int[]{ 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };        System.out.println(Arrays.toString(ns));        for (int i=0; i<ns.length-1;i++) {            for (int j=i+1;j<ns.length;j++){                if(ns[i] < ns[j]){                    temp = ns[i];                    ns[i] = ns[j];                    ns[j] = temp;                }            }        }        System.out.println(Arrays.toString(ns));        System.out.println(Arrays.toString(ns).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]"));////////////////////////////////////////////////////////////////////////////////////////////////////////////其他的懒得写了            }

_崔先生_

#2 Created at ... [Delete] [Delete and Lock User]

不出意料，格式超级乱

public static void main(String[] args) {
int temp;
// 冒泡排序1
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 -2; i++){
for (int j = 0;j < ns.length-1-i; j++){
if(ns[j] < ns[j+1]){
temp = ns[j];
ns[j] = ns[j+1];
ns[j+1] = temp;
}
}
}
System.out.println(Arrays.toString(ns));
System.out.println(Arrays.toString(ns).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]"));

//////////////////////////////////////////////////////////////////////////////////////////////////////////
// 冒泡排序2
ns = new int[]{ 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };
System.out.println(Arrays.toString(ns));

for(int i= ns.length - 1;i > 0; i--){
for (int j = 0;j < i; j++){
if(ns[j] < ns[j+1]){
temp = ns[j];
ns[j] = ns[j+1];
ns[j+1] = temp;
}
}
}
System.out.println(Arrays.toString(ns));
System.out.println(Arrays.toString(ns).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]"));
////////////////////////////////////////////////////////////////////////////////////////////////////////
// 选择排序
ns = new int[]{ 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };
System.out.println(Arrays.toString(ns));

for (int i=0; i<ns.length-1;i++) {
for (int j=i+1;j<ns.length;j++){
if(ns[i] < ns[j]){
temp = ns[i];
ns[i] = ns[j];
ns[j] = temp;
}
}
}
System.out.println(Arrays.toString(ns));
System.out.println(Arrays.toString(ns).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]"));
//////////////////////////////////////////////////////////////////////////////////////////////////////////
//其他的懒得写了
}

  • 1

Reply