exercise2.c

//documentation section 
/* Exercise 2 - Selection Sort*/

//pre-processor section 
#include<stdio.h>

//global variable section 
void swap(int* xp, int* yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}

void selectionSort(int arr[], int n)
{
    int i, j, min_idx;
 
    // 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
        swap(&arr[min_idx], &arr[i]);
    }
}

//main function section 
int main(){
    //write here your program
    int i; 
    int UA[] = {5,1,4,2,8};
    int n = sizeof(UA) / sizeof(UA[0]);
    selectionSort(UA, n);
    printf("Sorted Element using Selection Sort Technique is: ");
    for (i = 0; i < n; i++)
        printf("%d ", UA[i]);

    return 0;
    
}