Selection sort algorithm

This is C# example code for a selection sort algorithm. If you are not sure about the process of the selection sort, i recommend you to read:

Algorithm and Data Structure tutorial  

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

namespace ConsoleApplication1
{
class Program
{

static void Main(string[] args)
{
      int[] arr= new int[5]{23,2,3,34,6}; //unsorted data set
     selectsort(arr,5); //sorting process using selection sort
     int i;
     for(i=0;i<5;i++)
        Console.Write(arr[i]+"\t"); //after sorting
     Console.ReadLine();

}

///selection sort
static void selectsort(int[] dataset, int n){
  int i,j;
  for(i=0;i<n;i++){
         int min=i;     
         for(j=i+1;j<n;j++)
           if(dataset[j]<dataset[min]) min=j; //find min value
            //then swap it with the beginning item of the unsorted list
             int temp=dataset[i];
            dataset[i]=dataset[min];
            dataset[min]=temp;
          
}

       
}



  
}
}



HTML Comment Box is loading comments...



This website intents to provide free and high quality tutorials, examples, exercises and solutions, questions and answers of programming and scripting languages:
C, C++, C#, Java, VB.NET, Python, VBA,PHP & Mysql, SQL, JSP, ASP.NET,HTML, CSS, JQuery, JavaScript and other applications such as MS Excel, MS Access, and MS Word. However, we don't guarantee all things of the web are accurate. If you find any error, please report it then we will take actions to correct it as soon as possible.