Index: src/tests/concurrent/examples/quickSort.c
===================================================================
--- src/tests/concurrent/examples/quickSort.c	(revision 1edf37fa9f27600f8154d14f5a2c0819d03682b1)
+++ src/tests/concurrent/examples/quickSort.c	(revision fe4840a0136c44ad0224a7d34e69e00d45cd7f98)
@@ -9,6 +9,6 @@
 // Created On       : Wed Dec  6 12:15:52 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Dec 13 18:20:18 2017
-// Update Count     : 138
+// Last Modified On : Thu Dec 14 11:20:40 2017
+// Update Count     : 142
 // 
 
@@ -19,5 +19,5 @@
 #include <string.h>										// strcmp
 
-forall( otype T | { T ?<?( T, T ); } )
+forall( otype T | { int ?<?( T, T ); } )
 thread Quicksort {
 	T * values;											// communication variables
@@ -25,10 +25,10 @@
 };
 
-forall( otype T | { T ?<?( T, T ); } )
+forall( otype T | { int ?<?( T, T ); } )
 void ?{}( Quicksort(T) & qs, T values[], int size, int depth ) {
 	qs.values = values;  qs.low = 0;  qs.high = size;  qs.depth = depth;
 } // Quicksort
 
-forall( otype T | { T ?<?( T, T ); } )
+forall( otype T | { int ?<?( T, T ); } )
 void main( Quicksort(T) & qs ) {
 	// nested routines: information hiding
@@ -140,5 +140,7 @@
 			unsortedfile | size;						// read number of elements in the list
 		  if ( eof( unsortedfile ) ) break;
-			ELEMTYPE * values = anew( size );			// values to be sorted, too large to put on stack
+//			ELEMTYPE * values = anew( size );			// values to be sorted, too large to put on stack
+			ELEMTYPE * values = alloc( size );			// values to be sorted, too large to put on stack
+//			ELEMTYPE * values = (ELEMTYPE *)malloc( sizeof(ELEMTYPE) * size );
 			for ( int counter = 0; counter < size; counter += 1 ) { // read unsorted numbers
 				unsortedfile | values[counter];
@@ -165,5 +167,6 @@
 		processor processors[ (1 << depth) - 1 ] __attribute__(( unused )); // create 2^depth-1 kernel threads
 
-		ELEMTYPE * values = anew( size );				// values to be sorted, too large to put on stack
+//		ELEMTYPE * values = anew( size );				// values to be sorted, too large to put on stack
+		ELEMTYPE * values = alloc( size );				// values to be sorted, too large to put on stack
 		for ( int counter = 0; counter < size; counter += 1 ) { // generate unsorted numbers
 			values[counter] = size - counter;			// descending values