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.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main{

	public static void main(String args[]){
		new Main().mainrun();
	}

	private Scanner scan;
	private int N;
	private List<String> A;

	int cnt = 0;

	private void mainrun() {
		scan = new Scanner(System.in);

		N = scan.nextInt();
		A = new ArrayList<>();
		for(int i = 0;i < N ; i++) {
			A.add(scan.next() + " ");
		}

		bobbleSort();

		for(String num: A) {
			System.out.print(num);
		}

		System.out.println(cnt);

	}

	private void bobbleSort() {
		boolean flag = true;

		while(flag) {
			flag = false;
			for(int j = N - 1;j > 0;j--) {
				if(Integer.parseInt(A.get(j).trim()) < Integer.parseInt(A.get(j -1).trim())) {
					String tmp = A.get(j);
					A.set(j, A.get(j-1));
					A.set(j-1, tmp);

					cnt++;
					flag = true;

				}
			}

		}

		A.set(A.size() - 1, A.get(A.size() - 1).trim() + "\n");
	}
}