Problem:
Bubble Sort

Write a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

BubbleSort(A)
1 for i = 0 to A.length-1
2 for j = A.length-1 downto i+1
3 if A[j] < A[j-1]
4 swap A[j] and A[j-1]

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 4 of the pseudocode.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by spaces characters.

Output

The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints

1 ≤ N ≤ 100

Sample Input 1

5
5 3 2 4 1

Sample Output 1

1 2 3 4 5
8

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
9

Solution in JAVA (judge verdict: Accepted)

import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void printArray(List<Integer> array) {
		StringBuilder sb = new StringBuilder();
		sb.append(array.get(0));
		for (int j = 1; j < array.size(); j++) {
			sb.append(" ").append(array.get(j));
		}
		System.out.println(sb.toString());
	}

	static public List<Integer> acceptArray (InputStream ins) {
		Scanner sc = new Scanner(ins);
		int num = sc.nextInt();
		List<Integer> array = new ArrayList<Integer>();
		for (int i = 0; i < num; i++) {
			array.add(sc.nextInt());
		}
		return array;
	}

	static public List<Integer> bubbleSort (List<Integer> array) {
		// 1, 2,4,5,3
		//
		int swapCount = 0;
		for (int i = 0; i < array.size()-1; i++){
			for (int j = array.size()-1; j > i; j--) {
				if (array.get(j-1) > array.get(j)) {
					//swap
					int c = array.get(j);
					array.set(j, array.get(j-1));
					array.set(j-1, c);
					swapCount++;
				}
			}

		}
		printArray(array);
		System.out.println(swapCount);
		return array;
	}

	static public void main(String[] args) {
		List<Integer> array = acceptArray(System.in);
		List<Integer> sorted = bubbleSort(array);

	}
}