#include <stdio.h>
 
int main() {
    int arr[100], n, i, j, minIndex, temp;
 
    // Input number of elements
    printf("Enter number of elements: ");
    scanf("%d", &n);
 
    // Input array elements
    printf("Enter %d elements:\n", n);
    for(i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
 
    // Selection Sort algorithm
    for(i = 0; i < n - 1; i++) {
        minIndex = i; // Assume current as minimum
        for(j = i + 1; j < n; j++) {
            if(arr[j] < arr[minIndex])
                minIndex = j; // Update index of smaller element
        }
 
        // Swap if a smaller element is found
        if(minIndex != i) {
            temp = arr[i];
            arr[i] = arr[minIndex];
            arr[minIndex] = temp;
        }
    }
 
    // Display sorted array
    printf("\nSorted array in ascending order:\n");
    for(i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
 
    printf("\n");
    return 0;
}