The Program in C to sort a 1-d array using selection sort technique is given below:
#include <stdio.h>
void selectionSort(int arr[], int n)
{
int i, j, minIndex, temp;
for (i = 0; i < n-1; i++)
{
minIndex = i;
for (j = i+1; j < n; j++)
{
if (arr[j] < arr[minIndex])
minIndex = j;
}
temp = arr[minIndex];
arr[minIndex] = arr[i];
arr[i] = temp;
}
}
int main()
{
int arr[] = {64, 25, 12, 22, 11};
int n = sizeof(arr)/sizeof(arr[0]);
selectionSort(arr, n);
printf("Sorted array: \n");
for (int i=0; i < n; i++)
printf("%d ", arr[i]);
return 0;
}
Output:
Sorted array:
11 12 22 25 64
Pro-Tips💡
The selection sort algorithm repeatedly selects the smallest element from an unsorted array and places it at the beginning of the sorted array.
The code first defines a function called “selectionSort” that takes an array and its size as input and sorts the array using the selection sort algorithm.
The main function then declares an unsorted array of integers and calls the selectionSort function on it.
Finally, the sorted array is printed out..
Learn C-Sharp ↗
C-sharp covers every topic to learn about C-Sharp thoroughly.
Learn C Programming ↗
C-Programming covers every topic to learn about C-Sharp thoroughly.
Learn C++ Programming↗
C++ covers every topic to learn about C-Sharp thoroughly.