#include <stdio.h>

/* size of the array */
#define N 10

/* function prototypes */
void SortIntegerArray(int array[], int n); 
int FindSmallestInteger(int array[], int low, int high);
void SwapIntegerElements(int array[], int p1, int p2);


/* sort integer array size n */
void SortIntegerArray(int array[], int n)
{
	int lh, rh;
	
	for (lh = 0; lh < n; lh++) {
		rh = FindSmallestInteger(array, lh, n-1);
		SwapIntegerElements(array, lh,rh);
	}
}


/* find smallest integer */
int FindSmallestInteger(int array[], int low, int high)
{
	int i, spos;

	spos = low;
	for (i = low; i <= high; i++) {
		if (array[i] < array[spos]) spos=i;
	}
	return (spos);
}


/* swap two values of a matrix array with indeces p1 and p2 */
void SwapIntegerElements(int array[], int p1, int p2)
{
	int tmp;

	tmp = array[p1];
	array[p1] = array[p2];
	array[p2] = tmp;
}


/* main program sorting an array with size n */
int main()
{
	int array[N], ...
	


}


