# C# - Selection Sort Program

Here, we are going to learn how to implement selection Sort in C#? By Nidhi Last updated : March 28, 2023

Here, we will sort an integer array using selection sort.

## C# program to implement selection sort

The source code to implement selection sort is given below. The given program is compiled and executed successfully on Microsoft Visual Studio.

```// C# - Selection Sort Program

using System;

class Sort {
static void SelectionSort(ref int[] intArr) {
int temp = 0;
int min = 0;

int i = 0;
int j = 0;

for (i = 0; i < intArr.Length - 1; i++) {
min = i;

for (j = i + 1; j < intArr.Length; j++) {
if (intArr[j] < intArr[min]) {
min = j;
}
}
temp = intArr[min];
intArr[min] = intArr[i];
intArr[i] = temp;
}
}

static void Main(string[] args) {
int[] intArry = new int[5] {65, 34, 23, 76, 21};

Console.WriteLine("Array before sorting: ");
for (int i = 0; i < intArry.Length; i++) {
Console.Write(intArry[i] + " ");
}
Console.WriteLine();

SelectionSort(ref intArry);

Console.WriteLine("Array before sorting: ");
for (int i = 0; i < intArry.Length; i++) {
Console.Write(intArry[i] + " ");
}
Console.WriteLine();
}
}
```

## Output

```Array before sorting:
65 34 23 76 21
Array before sorting:
21 23 34 65 76
Press any key to continue . . .
```

## Explanation

In the above program, we created a class Sort that contains two static methods SelectionSort() and Main(). The SelectionSort() method is used to sort the elements of integer array in the ascending order.

In the selection sort, in every iteration, the smallest element is swapped to the current location. After completing the all iterations array will be sorted.

Now look to the Main() method, The Main() method is the entry point for the program. Here, we created the array of integers then sorted the array using the SelectionSort() method and print the sorted array on the console screen.