# Another sorting algorithm

**URL:** <https://discourse.julialang.org/t/another-sorting-algorithm/125884>\
**Category:** Data\
**Tags:** sorting\
**Created:** [February 14, 2025, 1:00am UTC](https://discourse.julialang.org/t/another-sorting-algorithm/125884 "2025-02-14T01:00:24Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![xiaodai](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/xiaodai/32/15937_2.png) [@xiaodai](https://discourse.julialang.org/u/xiaodai)\
**Post date:** [February 14, 2025, 1:00am UTC](https://discourse.julialang.org/t/another-sorting-algorithm/125884/1 "2025-02-14T01:00:24Z")

</div>

Julia has the base sort which has massive improved and also a couple of more experimental libraries including SortingAlgorithms.jl and SortingLab.jl.

I saw a sorting algorithm on Hacker News today which genuinely sounds interesting. Might be worthwhile implementing: [https://www.researchgate.net/publication/388955884\_JesseSort](https://www.researchgate.net/publication/388955884_JesseSort)

---

<div class="post-metadata">

**Author:** ![jar1](https://avatars.discourse-cdn.com/v4/letter/j/c0e974/32.png) [@jar1](https://discourse.julialang.org/u/jar1)\
**Post date:** [February 14, 2025, 10:02pm UTC](https://discourse.julialang.org/t/another-sorting-algorithm/125884/2 "2025-02-14T22:02:53Z")

</div>

Comments don’t sound promising

> <https://news.ycombinator.com/item?id=43044024>
>
> So the idea is that you'll eventually arrange n elements into ideally about √n sorted lists, organized so that the endpoints of these lists are also ordered (the "rainbow" shape). A new element goes on the end of one of those lists or a new list; which one is generally decided by binary search, but the index is saved to speed up the next insertion if it's the same. So a natural...