#include <stdio.h>


void sort(int *arr, int n){
    int i,j,m;
    for(i=0; i<n-1; i++){
        m = i;
        for(j=i+1; j<n; j++){
            if(arr[j] < arr[m])
                m = j;
        }
        if (m == i) continue;
        //swapping arr[i] and arr[m]
        *(arr + i) = *(arr + i) + *(arr + m);
        *(arr + m) = *(arr + i) - *(arr + m);
        *(arr + i) = *(arr + i) - *(arr + m);
    }
}

int main(void) {
	int arr[] = {2, 4, 3, 5, 8, 7};
	sort(arr, 6);
	for (int i = 0 ; i != 6 ; i++) {
		printf("%d\n", arr[i]);
	}
	return 0;
}