for(fill = 0; fill < (m-1); ++fill)
   {
     if(atomic_num[index_of_min] <= atomic_num[fill])
     {
     temp = atomic_num[index_of_min];
     atomic_num[index_of_min] = atomic_num[fill];
     atomic_num[fill] = temp;
     }
    ++index_of_min;
   }
 
 
   for(j = 0; j < (m-1); j++)
      fprintf(outp,"%d\n", atomic_num[j]);

#include <stdio.h>
#include <stdlib.h>
 
int CompareFunction(const void *p1, const void *p2)
{
    if (*(const int*)p1 > *(const int*)p2)
        return 1;
    else return -1;
    return 0;
}
 
int main()
{
    int i, a[5] = {5, 3, 2, 8, 1};
    qsort(&a, 5, sizeof(int), CompareFunction);
    for(i = 0; i < 5; i++)
        printf("%d  ", a[i]);
}

 
    /* indexes for loops */
    int a, b;
 
    /* How many elements atomic_num has? */
    int size = sizeof atomic_num / sizeof ( int );
 
    /* temporal storage */
    int temp;
 
 
    for ( a = 0; a < size - 1; a++ )
    {
        for ( b = a + 1; b < size; b++ )
	{
	    if ( atomic_num[a] > atomic_num[b] )
            {
		temp = atomic_num[a];
		atomic_num[a] = atomic_num[b];
		atomic_num[b] = temp;
	    }
	}
	/* printf( "%d\n", atomic_num[a] ); uncomment for displaying */
    }