1-1冒泡排序

package aha;

import java.util.Scanner;

public class maopao {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[100];
		for (int i = 1; i <= n; i++) {
			a[i] = sc.nextInt();
		}
		for (int i = 1; i <= n - 1; i++) {//共比较n-1次
			for (int j = 1; j <= n - i; j++) {
				if (a[j] > a[j + 1]) {
					int t = a[j];
					a[j] = a[j+ 1];
					a[j + 1] = t;
				}

			}
		}
		for (int i = 1; i <= n; i++) {
			System.out.print(a[i]);
		}

	}
}