解题思路:利用冒泡排序方法,
注意事项:
参考代码:
package lianxi;
import java.util.Scanner;
public class 排序 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t=0;
while (sc.hasNext()){
int n=sc.nextInt();
int [] a =new int[n];
for (int i = 0; i <a.length ; i++) {
a[i]=sc.nextInt();
}
for (int i = 0; i <a.length-1 ; i++) {
for (int j = 0; j <a.length-1-i; j++) {
if(a[j]>a[j+1])
{t=a[j];
a[j]=a[j+1];
a[j+1]=t;}
}
}
for (int i = 0; i <a.length ; i++)
System.out.print(a[i]+" ");
System.out.println();
}
}
}
0.0分
1 人评分