using System;

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Bubble Sort");

        // Check how efficient algorithm is

        int iterations = 0;

        bool switchesMade;

        //int[] nums = new int[]{15, 13, 2, 11, 6, 5, 16, 1};

        //int[] nums = new int[]{1, 3, 5, 6, 8, 10, 12};

        int[] nums = new int[]{1, 9, 5, 6, 8, 10, 12};

        // Outer loop

        for(int j = (nums.Length - 1); j >= 0; j--)

        {   

            switchesMade = false;

​

            // Inner loop

            for(int i = 0; i < (nums.Length - 1); i++)

            {

                // Switch if earlier element is bigger

                if( nums[i] > nums[i + 1] )

                {

                    int temp = nums[i];

                    nums[i] = nums[i + 1];

                    nums[i + 1] = temp;

                    // Performed a swap, record

                    switchesMade = true;

                }

​

                iterations++;

                // Exit inner loop if:

                if(i >= j)     // already processed end items

                {

                    break;

                }

            }

​

            // Exit outer loop if:

            if(!switchesMade)  // no switches made

            {

                break;

            }

        }

        // Output array

        Console.WriteLine(String.Format("In {0} iterations:", iterations.ToString()));

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

        {

            Console.WriteLine(nums[i]);

        }       

​

    }

}