//  Selection sort algorithm for n elements 
//  in a Monitored array, a.


#include <iostream.h>
#include "array.h"

extern MArray a;
void swap (int,int);

void selection (int n)
{  
   int pass, min, i;
   int t1;

   for (pass=0; pass<n-1; pass++)
     {  min = pass;
	t1 = a[min];
	for (i=pass+1; i<n; i++)
	  if (a[i]<t1)
	    {  min = i;
	       t1 = a[min];
	    }
	 if (min!=pass) swap (min,pass);
     }
}