C# example- selection sort algorithm

Selection sort algorithm

This is C# example code for a selection sort algorithm. In the selection sort, the list to be sorted is divided into tow parts: sorted and unsorted parts. The smallest item in the unsorted part is swapped with the beginning item of the unsorted list. Then the number of items in the sorted list increases by one and the number of the unsorted list decreases by one. To get more information about selection sort, i recommend you to read:

Selection Sort Algorithm  

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;
        Console.Write(arr[i]+"\t"); //after sorting


///selection sort
static void selectsort(int[] dataset, int n){
  int i,j;
         int min=i;     
           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];



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.