BonzaiThePenguin/WikiSort
View on GitHub ↗ ★ 1,292 C++
Fast and stable sort algorithm that uses O(1) memory. Public domain.
9 mentions on Hacker News by 8 people: 3 stories, 6 comments · first 2014-03-15 · latest 2022-03-08
20082026
-
…author is misrepresenting this. If you want to look at in-place merging, take a look at Wikisort: https://github.com/BonzaiThePenguin/WikiSort
comment by orlp · 2022-03-08 · in In-place merge algorithm using up to O(n+m) swaps and no temp swap space -
WikiSort should even be faster still Original author: https://github.com/BonzaiThePenguin/WikiSort Graph and copyage (by me): https://tse.gratis/aArray/#details Or grail sort: https://github.com/Mrrl/GrailSort/blob/master/README.md Sort,…
comment by tsegratis · 2019-10-08 · in Timsort, the Python sorting algorithm -
…https://en.wikipedia.org/wiki/Sorting_algorithm#Stability [2] https://github.com/Mrrl/GrailSort [3] https://github.com/BonzaiThePenguin/WikiSort [4] Chee K. Yap, "Fundamental Problems in Algorithmic Algebra", Chapter 10, Linear Systems,…
comment by abetusk · 2018-02-22 · in I don’t understand Graph Theory -
Most of these are possible to combine (see for example https://github.com/BonzaiThePenguin/WikiSort ), but I feel that this subset is impossible together: - Operates in place, requiring O(1) extra space. - Worst-case O(n·lg(n)) key…
comment by nightcracker · 2016-05-27 · in Sorting algorithms visualizer -
…something in-place and stable, you'll have to use something like WikiSort [1] or GrailSort [2]. [1] https://github.com/BonzaiThePenguin/WikiSort [2] https://github.com/Mrrl/GrailSort
comment by abetusk · 2014-10-14 · in Slightly Skeptical View on Sorting Algorithms -
…Span is O(log n) ; Work is O(n) ; so parallelism is O(n/logn) Detailed information here [1] [0] https://github.com/BonzaiThePenguin/WikiSort/blob/master/Cha... [1] http://electures.informatik.uni-freiburg.de/portal/download/...
comment by stokedmartin · 2014-03-15 · in WikiSort – Fast, stable, O(1) space merge sort algorithm