#include <stdio.h>
#include <stdlib.h>

#define  nil		 0
#define	 false		 0
#define  true		 1
#define  bubblebase 	 1.61
#define  dnfbase 	 3.5
#define  permbase 	 1.75
#define  queensbase 	 1.83
#define  towersbase 	 2.39
#define  quickbase 	 1.92
#define  intmmbase 	 1.46
#define  treebase 	  2.5
#define  mmbase 	 0.0
#define  fpmmbase 	 2.92
#define  puzzlebase 	 0.5
#define  fftbase 	 0.0
#define  fpfftbase 	 4.44

    /* Bubble, Quick */
#define sortelements 	 60000
#define srtelements 	 60000

    /* Bubble, Quick */ /*
    listsize = 0..sortelements;
    sortarray = array [listsize] of integer;
*/
    /* Bubble, Quick */
int    sortlist[sortelements+1],
    biggest, littlest,
    top;

/* global procedures */

#include <sys/param.h>

#ifdef BSD
#include <sys/time.h>
#include <sys/resource.h>
#endif


bInitarr1()
{
  int i, temp;
  biggest = 0; littlest = 0;
  for ( i = 1; i <= srtelements; i++ )
    {
      sortlist[i] = i;
      if ( sortlist[i] > biggest ) biggest = sortlist[i];
      else if ( sortlist[i] < littlest ) littlest = sortlist[i];
    };
};

Bubble1()
{
  int i, j;
  bInitarr1();
  top=srtelements;

  while ( top>1 ) {

    i=1;
    while ( i<top ) {

      if ( sortlist[i] > sortlist[i+1] ) {
        j = sortlist[i];
        sortlist[i] = sortlist[i+1];
        sortlist[i+1] = j;
      };
      i=i+1;
    };

    top=top-1;
  };
  if ( (sortlist[1] != littlest) || (sortlist[srtelements] != biggest) )
    printf ( "Error3 in Bubble.\n");
};



main()
{
  Bubble1();
  exit(0);
}