/* Tests QSortRandom (p87 of K&R) on a text file read in using ReadBatch 
*/

#include <stdio.h>
#define NMax 10

/* Function Prototypes */
int 	ReadBatch( int n, int CharArray[]);
void 	QSortRandom(int v[], int left, int right);
void 	Swap(int v[], int i, int j);

main()
{ 
int ActualSize,i;
int v[NMax];

/* Reading the Data */ 
ActualSize=ReadBatch(NMax,v);
/* Note that the QSort algorithm 
actually believes there is an entry at v[right]
This is not quite the normal C thing */
if(ActualSize<NMax)
	fprintf(stderr,"Did not get %i chars from file. Only got %i.\n",NMax,ActualSize);
	else
	fprintf(stderr,"Got %i chars from file.\n",ActualSize);
QSortRandom(v,0,ActualSize-1);
/* Dumping the output */
for(i=0; i<ActualSize; i++){
	printf("%c",v[i]);
	};
printf("\n");
}