PhD student Timo Bingmann has created an amazing video showing sorting algorithms in action. And it's surprisingly awesome!

See sort algorithm. Quick Sorting a List This quick sort uses randomly chosen pivots (in red) to keep dividing the list into two until there is only one item on each side of the pivot left.

Finally, you can put away your sorting funnels and ball-handling gloves – [Anthony] has the solution. That’s right – it’s a delta robot, tasked with the job of sorting golf balls by color.

It then proceeds to sort the copies of that array using std::sort, regular single-threaded quicksort, followed by a number of iterations of sorting with GPU-Quicksort in OpenCL 2.0.

Anyone who has taken a basic computer science class has undoubtedly spent time devising a sorting algorithm—code that will take an unordered list of items and put them in ascending or descending ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Computer scientists often ...