using System;

​

public class Test

{

    public static void Main()

    {

        // Insertion sort Algorithm - increasing

        int[] numbers = { 31, 41, 59, 26, 41, 58 };

        for(int index = 1; index < numbers.Length; index++)

        {

            int current = numbers[index];

            int i = index;

            while(i > 0 && current < numbers[i - 1])

            {

                int temp = numbers[i - 1];

                numbers[i - 1] = current;

                numbers[i] = temp;

                i--;

            }

        }

        Console.WriteLine(String.Join(", ", numbers));

        // Insertion sort Algorithm - decreasing

        int[] numbers_2 = { 31, 41, 59, 26, 41, 58 };

        for(int index = 1; index < numbers_2.Length; index++)

        {

            int current = numbers_2[index];

            int i = index;

            while(i > 0 && current > numbers_2[i - 1])

            {

                int temp = numbers_2[i - 1];

                numbers_2[i - 1] = current;

                numbers_2[i] = temp;

                i--;

            }

        }

        Console.WriteLine(String.Join(", ", numbers_2));

    }

}