test(	'test_progs/connect.pl','Graph Connectivity',
	polygrd,
	[X/[1],Y/[2]],
	connected(X,Y) ).     

test(	'test_progs/merge.pl','merge',
	polygrd,
	[Xs/[1],Ys/[2],Zs/[4]],
        merge(Xs,Ys,Zs) ).

test(	'test_progs/bugNrev.pl','Buggy Naive Reverse',
	polygrd,
	[X/[1],Y/[2]],
	nrev(X,Y) ).
	 
test(	'test_progs/buggyqs.pl','Buggy Quick Sort', 
	polygrd,
	[Li/[1],Lo/[2]],
        qs(Li,Lo) ).

test(	'test_progs/iqs.pl','Improved Quick Sort',
	polygrd,
	[Xs/[1],Ys/[2]],
        iqsort(Xs,Ys) ).     

test(	'test_progs/treesort.pl','Tree Sort',
	polygrd,
	[Xs/[1],Ys/[2]],
        treesort(Xs,Ys) ).

test(	'test_progs/lstDiff.pl','List Difference',
	polygrd,
	[X/[1],Y/[2],Z/[4]],
	diff(X,Y,Z) ).

test(	'test_progs/insert.pl','List Insertion',
	polygrd,
	[X/[1],Y/[2],Z/[4]],
	insert(X,Y,Z) ).

test(	'test_progs/icSort.pl','Interchange Sort',
	polygrd,
	[Xs/[1],Ys/[2]],
	sort(Xs,Ys) ).     

test(	'test_progs/qsDList.pl','Quick Sort with Difference List',
	polygrd,
	[Xs/[1],Ys/[2]],
	quicksort(Xs,Ys) ).

test(	'test_progs/lookup.pl','Dictionary Lookup in Binary Trees',
	polygrd, 
	[K/[1],D/[2],V/[4]],
	lookup(K,D,V) ).     

test(	'test_progs/permSort.pl','Permutation Sort',
	polygrd,
        [Xs/[1],Ys/[2]],
	sort(Xs,Ys) ).
		
test(	'test_progs/heapify.pl','Heapify Binary Trees',
	polygrd,
        [Tree/[1],Heap/[2]],
	heapify(Tree,Heap) ).     

test(	'test_progs/exponent.pl','Exponentiation by Multiplication',
	polygrd,
	[N/[1],X/[2],Y/[4]],
	exp(N,X,Y) ).     

test(	'test_progs/fact.pl','Factorial',
	polygrd,
	[N/[1],F/[2]],
	factorial(N,F) ).     

