selectionsort.cpp

#include <bits/stdc++.h>
using namespace std;

void swap(int *xp, int *yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}

void selectionSort(int arr[], int n)
{
    int i, j, min_idx;

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

        min_idx = i;
        for (j = i + 1; j < n; j++)
            if (arr[j] < arr[min_idx])
                min_idx = j;

        if (min_idx != i)
            swap(&arr[min_idx], &arr[i]);
    }
}

void display(int arr[], int size)
{
    int i;
    for (i = 0; i < size; i++)
        cout << arr[i] << " ";
    cout << endl;
}

int get()
{
    int size;
    printf("Enter Size of Array : ");
    scanf("%d", &size);
    int array[size];
    printf("Enter Elements of Array\n");
    for (int i = 0; i < size; i++)
    {
        scanf("%d", &array[i]);
    }
    printf("Given Array is\n");
    display(array, size);
    selectionSort(array, size);
    cout << "\nSorted Array : ";
    display(array, size);
    return 0;
}

int main()
{
    get();
}