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;
using System.Threading.Tasks;

namespace ALDS1_2_A
{
    public class Program
    {
        public static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());
            var a = Console.ReadLine().Split(' ').Select(x => int.Parse(x));

            BubbleSort(a, n);
        }

        public static IEnumerable<Type>  BubbleSort<Type>(IEnumerable<Type> A, int N)
            where Type : IComparable
        {
            var flag = true;
            var a = A.ToArray();
            var count = 0;

            while (flag) 
            {
                flag = false;
                for(int i = N - 1; i > 0; i--)
                {
                    if(a[i].CompareTo(a[i - 1]) < 0)
                    {
                        var temp = a[i];
                        a[i] = a[i - 1];
                        a[i - 1] = temp;
                        flag = true;
                        count++;
                    }
                }
            }

            Console.WriteLine(OutputArray(a));
            Console.WriteLine(count);

            return A;
        }

        public static string OutputArray<Type>(IEnumerable<Type> array)
            where Type : IComparable
        {
            string aa = "";
            var a = array.ToArray();

            for (int k = 0; k < a.Length; k++)
            {
                aa += a[k];

                if (k != a.Length - 1)
                {
                    aa += " ";
                }
            }

            return aa;
        }
    }
}