🏡 This is the central code repository of the greeNsort® project for symmetric sustainable sorting
📰 greeNsort® article
📖 greeNsort® report
🍀 greeNsort® R package with partially novel C-algorithms and R-testbed (not tuned for fair comparison)
🍁 greeNsort® Rcpp package with prior art C++ algorithms (tuned, not comparable)
🌱 greeNsort® algorithms are designed to make software greener
🌿 need less runtime, energy and CO2
🌳 need less memory hence better hardware amortization
🔋 can save up to 4 nuclear power stations worldwide
💡 How? Better sorting algorithms in central software components
🚂 Research method: analyzing the prior-art and
🚀 designing and testing many innovative algorithms
🚴 such that they are more sustainable
🌵 after a thorny journey
🍄 we identifed poisened limiting assumptions
🌻 designed a new theory of sorting with
📐 new sustainability measurements
🎨 new techniques that are simple and beautiful
🔧 new algorithms that are sustainable
📊 and have nice empirical results
↯ Zacksort and Zucksort are more adaptive than binary Quicksort and more efficient than ternary Quicksort
🦆 Ducksort is more adaptive than Zacksort and Zucksort
🦢 Swansort is stable and cache-friendlier than conventional stable binary partitioning, and travelling Storksort also needs less RAM
🐸 Frogsort is more adaptive, cache-friendlier and needs less memory than Mergesort
🦎 Geckosort is semi-bi-adaptive, cache-friendlier and needs less memory than Mergesort
🦑 Octosort is full bi-adaptive, and Squidsort is cache-friendlier and needs less RAM: both sort faster than Timsort
🦚 and some more beautiful powerful algorithms
🔭 For more information see greensort.org