using System;

public class Program

{

    public static void Main()

    {

        int[] arr = new int[5] {17,5,9,0,2};

        int[] sel = new int[5];

        int[] bob=new int[5];

        int[] ins =new int[5];

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

        {

            sel[i]=arr[i];

            bob[i]=arr[i];

            ins[i]=arr[i];

        }

​

        Console.WriteLine(selection(sel));

        Console.WriteLine(bubble(bob));

        Console.WriteLine(Insertion(ins));

​

    }

    public static int selection(int [] sel)

    {

        int selnum=0;

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

        {

            int min = i;

            selnum++;

            for (int j = i + 1; j < sel.Length; j++) 

            {

                if (sel[j] < sel[min]) 

                {

                    min = j;

                    selnum++;

                }

            }

            if (i != min)

            {

                int swap = sel[i];

                sel[i] = sel[min];

                sel[min] = swap;

                selnum=selnum+3;

            }

        }    

        return(selnum);

    }

    public static int bubble(int [] bob)

    {

        int bobnum=0;

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

        {

        int min = i;

            bobnum++;

        for (int j = i + 1; j < bob.Length; j++) 

        {

            if (bob[j] < bob[min]) 

            {

                min = j;

                bobnum++;

            }

        }

            if (i != min)

            {

            int swap = bob[i];

            bob[i] = bob[min];

            bob[min] = swap;

            bobnum=bobnum+3;

            }

        }    

                return(bobnum);

​

    }

    public static int Insertion(int [] ins)

    {

        int insnum=0;

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

        {

        int min = i;

        insnum++;

        for (int j = i + 1; j < ins.Length; j++) 

        {

            if (ins[j] < ins[min]) 

            {

                min = j;

                insnum++;

            }

        }

            if (i != min)

            {

            int swap = ins[i];

            ins[i] = ins[min];

            ins[min] = swap;

            insnum=insnum+3;                

            }

        }    return(insnum);

​

    }

}