timothy from the quick-like-double-time dept.
An anonymous reader writes "Researchers at the University of Virginia have recently open sourced an algorithm capable of sorting at a rate of one billion (integer) keys per second using a GPU. Although GPUs are often assumed to be poorly suited for algorithms like sorting, their results are several times faster than the best known CPU-based sorting implementations."
You can measure a programmer's perspective by noting his attitude on
the continuing viability of FORTRAN.
-- Alan Perlis