// To implement selection sort

#include <stdio.h>
#include <stdlib.h>
#define MAX 20

void display(int a[], int n){
    int i;
    printf("\n Elements in array: ");
    for( i=0; i<n; i++)
        printf(" %d ", a[i]);
}

void sort(int ary[], int n){
    int i, j, min;
    
    for( i=1; i<n; i++){
        // find the minimum in array [i-1 ... n-1]
        min = i-1;
        for( j=i; j<n; j++)
            if( ary[j] < ary[min])
                min = j;
        // if i-1th is not minimum then swap it with min
        if( min != i-1){
            j = ary[min];
            ary[min] = ary[i-1];
            ary[i-1] = j;
        }
    }
}

int main(){
    int a[20];
    int n, i;
    
    printf("\n Enter total number of elements in array (max. %d): ", MAX);
    scanf("%d", &n);
    
    if( n < 0)
        printf("UNDERFLOW \n");
    else if( n > MAX)
        printf("OVERFLOW \n");
    else{
        // input elements one by one
        printf("\n Enter item(s) one by one\n");
        for( i=0; i<n; i++){
            printf(" Enter item no %d : ",i);
            scanf("%d", &a[i]);
        }
        
        printf("\n Before Sorting");
        display(a,n);
        sort( a, n);
        printf("\n After Sorting");
        display(a,n);
        printf("\n ");
    }
        
    system("pause");
    return 0;
}