Changeset 764b4b2 for src/tests/concurrent/examples/quickSort.c
- Timestamp:
- Jan 24, 2018, 10:54:51 AM (7 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
- Children:
- c916e12
- Parents:
- 15d248e
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/tests/concurrent/examples/quickSort.c
r15d248e r764b4b2 1 // 1 // 2 2 // The contents of this file are covered under the licence agreement in the 3 3 // file "LICENCE" distributed with Cforall. 4 // 4 // 5 5 // quickSort.c -- In-place concurrent quick-sort: threads are created to partition to a specific depth, then sequential 6 6 // recursive-calls are use to sort each partition. 7 // 7 // 8 8 // Author : Peter A. Buhr 9 9 // Created On : Wed Dec 6 12:15:52 2017 … … 11 11 // Last Modified On : Thu Dec 14 11:20:40 2017 12 12 // Update Count : 142 13 // 13 // 14 14 15 15 #include <fstream> … … 123 123 } // choose 124 124 } else if ( strcmp( argv[1], "-t" ) == 0 ) { 125 unsortedfile = *(ifstream *)0; // no input125 &unsortedfile = (ifstream *)0; // no input 126 126 choose ( argc ) { 127 127 case 4:
Note: See TracChangeset
for help on using the changeset viewer.