Selection Sort Algorithm

  • July 23, 2019
  • by
// C# : Selection Sort

using System;

class Secimli
{
  static void sort(int []arr)
  {
    int n = arr.Length;

    // One by one move boundary of unsorted subarray
    for (int i = 0; i < n - 1; i++)
    {
    // Find the minimum element in unsorted array
    int min_idx = i;
    for (int j = i + 1; j < n; j++)
      if (arr[j] < arr[min_idx])
        min_idx = j;

    // Swap the found minimum element with the first element
    int temp = arr[min_idx];
    arr[min_idx] = arr[i];
    arr[i] = temp;
    }
  }

  // Prints the array
  static void printArray(int []arr)
  {
    int n = arr.Length;
    for (int i=0; i<n; ++i)
    Console.Write(arr[i]+" ");
    Console.WriteLine();
  }

  // Driver code
  public static void Main()
  {
    int []arr = {64,25,12,22,11};
    sort(arr);
    Console.WriteLine("Sorted array");
    printArray(arr);
  }

}

You may also Like

Leave a reply

Your email address will not be published. Required fields are marked *

About Me

I am a dad of two wonderful boys, Utku Efe and Omer Eren, and married with Elif. In addition, I am an academician and AI/ML scientist because I worked more than 15 years in universities, have M.S and Ph.D. thesis and more than 20 scientific papers/presentations and 100 citations. Now people call me as a Principal Developer in my last company :).
I am really hungry on learning new technologies and get more fun while developing new softwares.

Stay Connected

×