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.Linq;

namespace aoj
{
    class Program
    {
        static void Main(string[] args)
        {
            var length = int.Parse(Console.ReadLine());
            int[] array = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();

            bubbleSort(ref array, length);
        }

        static void bubbleSort(ref int[] _array, int _length)
        {
            var count = 0;

            // 逆の隣接要素が存在する
            var flag = true;
            while (flag)
            {
                flag = false;
                for (var i = _length - 1; 0 < i; --i)
                {
                    if (_array[i] < _array[i - 1])
                    {
                        Swap(ref _array[i], ref _array[i - 1]);
                        ++count;
                        flag = true;
                    }
                }
            }

            for (var i = 0; i < _length; ++i)
            {
                Console.Write(_array[i]);
                if (i != _length - 1)
                {
                    Console.Write(" ");
                }
            }
            Console.WriteLine();
            Console.WriteLine(count);
        }

        static void Swap(ref int _a, ref int _b)
        {
            var tmp = _a;
            _a = _b;
            _b = tmp;
        }
    }
}