using System;

using System.Diagnostics;

​

namespace shorting

{

    internal class Program

    {

        private static void Main(string[] args)

        {

            Stopwatch sw = new Stopwatch();

            int[] pinakas = new int[2000];

            int[] pinakas2 = new int[2000];

            int[] pinakas3 = new int[2000];

​

            int j = 1;

​

            for (int k = 0; k < pinakas.Length; k++)

            {

                pinakas[k] = pinakas.Length - k;

                pinakas2[k] = pinakas2.Length - k;

                pinakas3[k] = pinakas3.Length - k;

                j++;

            }

​

            sw.Start();

            QuickSort(pinakas, 0, pinakas.Length - 1);

            sw.Stop();

            Console.WriteLine("quick: " + sw.Elapsed.TotalSeconds);

            sw.Start();

            Partition(pinakas2, 0, pinakas.Length - 1);

            sw.Stop();

            Console.WriteLine("partition: " + sw.Elapsed.TotalSeconds);

            sw.Start();

            BubbleSort(pinakas3);

            sw.Stop();

            Console.WriteLine("bubble: " + sw.Elapsed.TotalSeconds);

​

            Console.ReadLine();

        }

​

        public static void BubbleSort(int[] pinakas)

        {

            int help;

            int swap = 0;

            for (int k = 0; k < pinakas.Length; k++)

            {

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

                {

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

                    {

                        help = pinakas[j + 1];

                        pinakas[j + 1] = pinakas[j];

                        pinakas[j] = help;

                        swap = 1;

                    }

                }

                if (swap == 0)

                {

                    break;

                }

            }

        }

​

        public static void QuickSort(int[] a, int startindex, int endindex)

        {

            if (startindex >= endindex)

            {

                return;

            }

            int pindex = Partition(a, startindex, endindex);

            QuickSort(a, startindex, pindex - 1);

            QuickSort(a, pindex + 1, endindex);

        }

​

        public static int Partition(int[] pinakas, int startindex, int endindex)

        {

            int temp;

            int pindex = startindex;

            int pivot = pinakas[endindex];

            for (int k = startindex; k < endindex; k++)

            {

                if (pinakas[k] < pivot)

                {

                    temp = pinakas[k];

                    pinakas[k] = pinakas[pindex];

                    pinakas[pindex] = temp;

                    pindex++;

                }

            }

​

            temp = pinakas[pindex];

            pinakas[pindex] = pinakas[endindex];

            pinakas[endindex] = temp;

​

            return pindex;

        }

    }

}