Simple Selection Sort, C#

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Microsoft (R) Visual C# Compiler version 2.9.0.63208 (958f2354)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            int[] arr = { 5, 8, 1, 8, 4, 5, 6, 5, 4 };

Console.WriteLine("Start Selection Sort");
            Console.Write("Start array: ");
            arr.ToList().ForEach(x => Console.Write(x + " "));

//sort

for (int i = 0; i < arr.Length; i++)
            {
                //index of minimum value
                int min_index = i;

//find minimum value
                for (int j = i + 1; j < arr.Length; j++)
                {
                    if (arr[j] < arr[min_index])
                    {
                        min_index = j;
                    }
                }

//replace minimum and current value
                int c = arr[min_index];
                arr[min_index] = arr[i];
                arr[i] = c;
            }

Console.Write("\nSorted array: ");
            arr.ToList().ForEach(x => Console.Write(x + " "));
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 5,3 sec, absolute running time: 0,11 sec, cpu time: 0,11 sec, average memory usage: 12 Mb, average nr of threads: 2, absolute service time: 5,44 sec