/*

Selection sort starts from index 0 and compares every other element in the array

and picks up the smallest of all and place it in the position 0.

it then starts from index 1 and compare it all the other elements and get the smaller one and replaces it with the element at index 1.

This process continues untill we reach the end.

*/

​

using System;

public class Program

{

    public static void Main()

    {

        int[] arr = new int[10] { 100, 50, 20, 40, 10, 60, 80, 70, 90, 30 };

        int arrLength=arr.Length;

        int tmp,min_key;

        for(int i=0;i<arrLength-1;i++){

            min_key=i;

            for(int j=i+1;j<arrLength;j++){

                if(arr[j]<arr[min_key])

                    min_key=j;

            }

            tmp=arr[i];

            arr[i]=arr[min_key];

            arr[min_key]=tmp;

        }

        for(int k=0;k<arrLength;k++)

            Console.WriteLine(arr[k].ToString());

    }

}