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.BufferedReader;
import java.io.InputStreamReader;
 
class Main {
    public static void main(String[] args) throws Exception {
        // ??\???????????????
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int length = Integer.parseInt(br.readLine());
        String[] sarray = br.readLine().split(" ",length);
        // ???????????????????????????  
        bubbleSort(sarray , length);
          
    }
    
    public static void bubbleSort(String[] sarray , int length) {
        String str;
        StringBuilder sb = new StringBuilder();
        boolean flag = true;
        int cnt = 0;
        int k = 0;
        
        while ( flag == true ){
            flag = false;
            // ????????????????????????
            for ( int j = length - 1 ; j > k ; j--){
                if( Integer.parseInt(sarray[j]) < Integer.parseInt(sarray[j - 1]) ) {
                    str = sarray[j];
                    sarray[j] = sarray[j - 1];
                    sarray[j - 1] = str;
                    
                    cnt = cnt + 1;
                    flag = true;
                }
            }
            k = k++;
        }
        for ( int i = 0 ; i < length ; i++){
            if ( i > 0 ){
                sb = sb.append(" ");
            }
            sb = sb.append(sarray[i]);
        }
        System.out.println(sb);
        System.out.println(cnt);
    }
};