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 C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace _20170409_AOJ
{
    class ALDS1_2A
    {
        static int count = 0;
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            int[] iArr = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
            BubbleSort(iArr, n);

            WriteArr(iArr);
            Console.WriteLine(count);

            Console.ReadLine();
        }

        static void BubbleSort(int[] _arr, int _n)
        {
            bool flag = true;
            while (flag)
            {
                flag = false;
                for (int j = _n - 1; j > 0; j--)
                {
                    if (_arr[j] < _arr[j - 1])
                    {
                        int tmp = _arr[j];
                        _arr[j] = _arr[j - 1];
                        _arr[j - 1] = tmp;
                        flag = true;
                        count++;
                    }
                }
            }
        }

        static void WriteArr(int[] _arr)
        {
            int len = _arr.Length;
            if (len > 0)
            {
                Console.Write(_arr[0]);
            }

            if (len > 1)
            {
                for (int i = 1; i < len; i++)
                {
                    Console.Write(string.Format(" {0}", _arr[i]));
                }
            }
            Console.Write("\r\n");
        }
    }
}