This tutorial demonstrates these features on our very own GPU-Quicksort implementation in OpenCL, which, as far as we know, is the first known implementation of that algorithm in OpenCL.

Those quicksort calls again recurse until only one-element arrays are passed into the recursive calls. Only then will the recursive calls return—deepest call first—until we return to the main function ...

GPU-Quicksort in OpenCL 1.2 The GPU-Quicksort in OpenCL 1.2 is a straightforward implementation following the algorithms described in the Cederman/Tsigas paper.

Greedy Algorithms Dynamic Programming Algorithms Algorithms for the following primitives: Sorting: bubblesort, mergesort, heapsort, quicksort. Searching Graph Algorithms: Depth/Breadth First Search, ...