strikeraryu
/ quick_sort.chpl
Last active
April 14, 2021 13:55
Quick-sort algorithm implemented in chapel, I have used Task parallelism to improve upon it.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| use List; | |
| config var n_parallel = 4; | |
| /** | |
| for partition of array on a pivot(last element) | |
| arguments | |
| arr int[] (ref) -> array where the partition is done | |
| l int -> left bound | |
| r int -> right bound | |
| returns int ->point of partition |