greeNsort® releases sorting algorithms for reduction of CO2 emissions

German database-architect Jens Oehlschlägel has developed symmetric sorting techniques that achieve better trade-offs between buffer-memory and energy consumption in contiguous memory. His Zacksort realizes the adaptivity of a ternary Quicksort at (almost) the lower cost of a binary Quicksort, an open problem since 1961. His Frogsort needs less buffer and is more adaptive (and often even faster) than Mergesort invented in 1945.

» Read more on greeNsort.org