Index: src/tests/concurrent/examples/quickSort.c
===================================================================
--- src/tests/concurrent/examples/quickSort.c	(revision b834e98393306fc30c2857f5d569dc319f987d67)
+++ src/tests/concurrent/examples/quickSort.c	(revision 764b4b24dbc67225234679918ac1f34d96d5feed)
@@ -1,9 +1,9 @@
-// 
+//
 // The contents of this file are covered under the licence agreement in the
 // file "LICENCE" distributed with Cforall.
-// 
+//
 // quickSort.c -- In-place concurrent quick-sort: threads are created to partition to a specific depth, then sequential
 //		recursive-calls are use to sort each partition.
-// 
+//
 // Author           : Peter A. Buhr
 // Created On       : Wed Dec  6 12:15:52 2017
@@ -11,5 +11,5 @@
 // Last Modified On : Thu Dec 14 11:20:40 2017
 // Update Count     : 142
-// 
+//
 
 #include <fstream>
@@ -123,5 +123,5 @@
 			} // choose
 		} else if ( strcmp( argv[1], "-t" ) == 0 ) {
-			unsortedfile = *(ifstream *)0;				// no input
+			&unsortedfile = (ifstream *)0;				// no input
 			choose ( argc ) {
 			  case 4: