第二行包含n個整數,爲待排序的數,每個整數的絕對值小於10000。
8 3 6 4 9
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [] sequence = new int[200];
if(n >= 1 && n <= 200){
for(int i = 0;i < n; i++){
int input = sc.nextInt();
sequence[i] = input;
}
for(int i = 0; i < n-1; i++){
for(int j = i+1;j < n; j++){
if(sequence[j] < sequence[i]){
int temp = sequence[j];
sequence[j] = sequence[i];
sequence[i] = temp;
}
}
}
for(int i = 0; i < n; i++){
System.out.print(sequence[i] + " ");
}
}
}
}
冒泡排序:
for(int i = 0; i < n-1; i++){
for(int j = 0;j < n - i - 1 ; j++){
if(sequence[j + 1] < sequence[j]){
int temp = sequence[j];
sequence[j] = sequence[j + 1];
sequence[j + 1] = temp;
}
}
}