Selection sort (code & Algorithm)

In this blog you have to know all about the Selection sort, Step by step how to work Selection sort Algorithm and also you have to know how to write code in an easy way for selection sort.

In Selection sort we are arranging unordered number in a correct order,

Examples: This is unordered number (9,6,4,7,3,2,4,5,) but by using selection sort we can arrange in ascending order (2,3,4,5,6,7,9) this is our selection sort, to arrange in an order of given unorder number.

      Algorithm:

f

Code for Selection sort:

#include <stdio.h>

// Function to perform selection sort on an array

void selectionSort(int arr[], int n) {

    int i, j, min_idx, temp;

    // One by one move boundary of unsorted subarray

    for (i = 0; i < n-1; i++) {

        // Find the minimum element in unsorted array

        min_idx = i;

        for (j = i+1; j < n; j++) {

            if (arr[j] < arr[min_idx]) {

                min_idx = j;

            }

        }

        // Swap the found minimum element with the first element

        temp = arr[min_idx];

        arr[min_idx] = arr[i];

        arr[i] = temp;

    }

}

// Function to print an array

void printArray(int arr[], int n) {

    int i;

    for (i = 0; i < n; i++) {

        printf("%d ", arr[i]);

    }

    printf("\n");

}

int main() {

    int arr[] = {64, 25, 12, 22, 11};

    int n = sizeof(arr) / sizeof(arr[0]);

    printf("Original array: \n");

    printArray(arr, n);

    selectionSort(arr, n);

    printf("Sorted array: \n");

    printArray(arr, n);

    return 0;

}

Output:

                     Original array: 64 25 12 22 11 

                      Sorted array: 11 12 22 25 64 

 Up to this it's all about Selection Sort.