using System;

public class Program

{

    public static void Main()

    {

        // Test Case #1

        int[] a = {1,2,3};

        countSwaps(a); 

        // Array is sorted in 0 swaps.

        // First Element: 1

        // Last Element: 3

        // Test Case #2

        int[] b = {3,2,1};

        countSwaps(b);

        // Array is sorted in 3 swaps.

        // First Element: 1

        // Last Element: 3

        // Test Case #3

        int[] c = {4,2,3,1};

        countSwaps(c);

        // Array is sorted in 5 swaps.

        // First Element: 1

        // Last Element: 4

    }

    // Complete the countSwaps function below.

    static void countSwaps(int[] a) {

​

        int temp;

        int count = 0;

        // Bubble Sort

        for (int i = 0; i < a.Length; i++) 

        {

            for (int j = 0; j < a.Length - 1; j++) 

            {

                // Swap adjacent elements if they are in decreasing order

                if (a[j] > a[j + 1]) 

                {

                    temp = a[j + 1];

                    a[j + 1] = a[j];

                    a[j] = temp;

​

                    count += 1;

                }

            }

        }

        Console.WriteLine("Array is sorted in {0} swaps.", count);

        Console.WriteLine("First Element: {0}", a[0]);

        Console.WriteLine("Last Element: {0}", a[a.Length -1]);

​

    }

}