Index: src/tests/concurrent/examples/quickSort.c
===================================================================
--- src/tests/concurrent/examples/quickSort.c	(revision f0322e2081a0f0317a6822041312273f4fd2881d)
+++ src/tests/concurrent/examples/quickSort.c	(revision ebcb7bae48a91da35fda728980c5e82dc87fd7e6)
@@ -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 : Mon Jan 29 08:41:37 2018
 // Update Count     : 155
-// 
+//
 
 #include <fstream>