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.Scanner;
class Main{
    
    static int[] A;

    public static void main(String[] args){
	int i = 0;
	Main bubble = new Main();
	Scanner scan = new Scanner(System.in);
	int n = scan.nextInt();
	A = new int[n];
	
	while(i<n){
	    A[i++] = scan.nextInt();
	    //	    i++;
	}
	int count = 0;
	count = bubble.bubblesort(A);
	bubble.call(n);
	System.out.println(count);
    }
    


    public int bubblesort(int[] A){
	int count =0;
	for(int i = 0;i<A.length ;i++){

	    for(int j = A.length-1;j >=i+1;j--){
		if(A[j]<A[j-1]){
		    swap(j,j-1);
		    count++;
		}
	    }
	}
	return count;
	
    }

    public void swap(int x,int y){
	int m = 0;
	int n = 0;
	m = A[x];
	n = A[y];
	A[x] = n;
	A[y] = m;

    }

    public void call(int n){
	int i =0;
	while(true){
	    if(i!=0) System.out.print(" ");
	    System.out.print(A[i]);
	    i++;
	    if(i==n)break;
	}
	System.out.println();
    }
    

}