import java.util.Scanner;

public class BubbleSort {

	public static Integer[] array;

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);
		System.out.println("Enter length of list");

		Integer length = scan.nextInt();
		array = new Integer[length];

		System.out.println("Enter list of " + length + " Integers");

		for (int i = 0; i < length; i++) {
			array[i] = scan.nextInt();
		}
		double startTime = System.currentTimeMillis();

		Integer[] array2 = bubbleSort(array);

		for (int i = 0; i < array2.length; i++) {
			System.out.println(array2[i]);
		}
		double endTime = System.currentTimeMillis();
		System.out.println("Total time taken = " + (endTime - startTime));
		scan.close();
		//for 1000 took 34ms
	}

	public static Integer[] bubbleSort(Integer[] array) {

		for (int i = 0; i < array.length - 1; i++) {
			for (int j = i + 1; j < array.length; j++) {
				if (array[i] > array[j]) // If element at i is greater than element at j
				{ // THEN
					Integer temp = array[i]; // store element at i in temp
					array[i] = array[j]; // replace current at i with element at j
					array[j] = temp; // replace element at j with temp
				}
			}
		}
		return array;
	}

}