//  Bubble sort algorithm for MAX elements 
//  in a Monitored array, a.


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

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

void bubble (int n)
{  int bound = n-1;
   int t;
// Control order of operand evaluation.  July '01.
   int left, right;

   while (bound)
     {  t = 0;
        for (int i=0; i<bound; i++)
     	  {   
		left = a[i];
		right = a[i+1];
		if (left>right)
		{  swap (i+1, i);
		   t = i;
		}
	  }
	bound = t;
     }
}