//tslist.cpp
//test driver for class SortedList (both implementations)
//include file may be slist.h or slist1.h

#include <iostream.h>
#include <assert.h>
#include <stdlib.h>
#include "slist.h"


main()
{
	SortedList l, l1, l2, l3;
	int i;
	int u[10] = {4, 6, -5, 11, 64, -20, -11, 0, 10, 6};


	assert(l.isempty());
	assert(!l.find(10));

	cout<<"\nSorted List after unsorted input:\n";
	for (i=0; i<10; i++)
		l.insert(u[i]);
	assert(!l.isempty());
	l.print();

	assert(l.find(-20));
	assert(l.find(-5));
	assert(l.find(64));
	assert(!l.find(13));

	cout<<"\nSorted List after input in ascending order:\n";
	for (i=0; i<10; i++)
		l1.insert(i);
	l1.print();

	cout<<"\nSorted List after input in descending order:\n";
	for (i=10; i>=0; i--)
		l2.insert(i);
	l2.print();

	cout<<"\nSorted List after big input:\n";
	for (i=0; i<120; i++)
		l3.insert(rand()%999);
	l3.print();

	return 0;
}