排序算法

import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] arr = new int
;
for (int i = 0; i < n; i++)
arr[i] = in.nextInt();
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++)
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
for (int i = 0; i < n; i++) {
System.out.print(arr[i]+" ");
}
}
}