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.

Optimizing this algorithm is left as an exercise for the masochistic reader. Note that you can click Interrupt, then Run to start over at any time. Click Next until i equals 3 and last equals 2 (watch ...

The Metropolis algorithm for Monte Carlo methods, the simplex method in linear programming, the Fast Fourier Transform for analyzing and manipulating digital data, and the Quicksort algorithm fit ...