May 2018
Intermediate to advanced
328 pages
8h 15m
English
Write a parallel version of the sort algorithm as defined for problem 53. Sort Algorithm, in Chapter 6, Algorithms and Data Structures, which, given a pair of random access iterators to define its lower and upper bounds, sorts the elements of the range using the quicksort algorithm. The function should use the comparison operators for comparing the elements of the range. The level of parallelism and the way to achieve it is an implementation detail.
Read now
Unlock full access