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;

namespace ALDS1_2_A
{
    class Program
    {
        static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());
            var v = Console.ReadLine();
            var values = v.Split(' ').Select(s => int.Parse(s)).ToList();
            BubbleSort(values, values.Count());
        }
        
        public static void BubbleSort(List<int>targetArray,int arrayLength)
        {
            int i = 0;
            int count = 0;
            while (i <= arrayLength)
            {
                for (int j = arrayLength - 1; j > i; j--)
                {
                    if (targetArray[j] < targetArray[j - 1])
                    {
                        int temp = targetArray[j - 1];
                        targetArray[j - 1] = targetArray[j];
                        targetArray[j] = temp;
                        count++;
                    }
                }
                i++;
            }
            OutputList(targetArray);
            Console.WriteLine(count);
            return;
        }

        public static void OutputList(List<int> targetArray)
        {
            for (int i = 0; i < targetArray.Count; i++)
            {
                if (i == targetArray.Count - 1)
                {
                    Console.WriteLine(targetArray[i]);
                }
                else
                {
                    Console.Write(targetArray[i]);
                    Console.Write(' ');
                }
            }
            return;
        }
    }
}