******** fig3.61 **********

/*1*/	for(i=0; i<last_position; i++ )
	{
/*2*/		j = i+1;
/*3*/		while( j < last_position )
/*4*/			if( a[i] == a[j] )
/*5*/				DELETE(j);
			else
/*6*/				j++;
	}