Selection Sort Algorithm, C#

Language: Layout:

//Title of this code
//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

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[] ar={5,3,7,2};
            int n=ar.Length;
            for(int x=0; x<n; x++)
            {
                int min_index=x;
                for(int y=x; y<n; y++)
                {
                    if(ar[min_index]>ar[y])
                    {
                        min_index=y;
                    }
                }
                int temp=ar[x];
                ar[x]=ar[min_index];
                ar[min_index]=temp;
            }
            
            Console.WriteLine("Sort array in ascending order by using Selection Sort");
            
            foreach(int i in ar)
            {
                Console.Write(i+", ");
            }
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0.08 sec, absolute running time: 0.06 sec, cpu time: 0.06 sec, average memory usage: 16 Mb, average nr of threads: 4