simple linear-time sorting algorithm, using a flattened linked-list index
2 comments · c, programming, scaling
- Comments2
2 comments · c, programming, scaling
Story details from Lobsters ↗ · linked article on gist.github.com.
simple linear-time sorting algorithm, using a flattened linked-list index was first seen on Lobsters · Hottest on Oct 31, 2026. Since then it has appeared in 1 check on 1 different day. Its best position was #19 of 25, reached on Oct 31, 19:21 UTC. It dropped off the list after Oct 31, 19:21 UTC.
Position on Lobsters · Hottest at every check (lower is better).
Best rank per day (UTC).
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
Speaking as the author of that gist, "scaling" is ... kind of a weird tag for this. I shared it because I find linear-time sorts fascinating in general, and I haven't seen this one documented anywhere. A more traditional counting sort or radix sort is likely to be faster, unless the data set is fairly small. The…
Interesting. In principle you should be also able to build an arbitrary number of indexes of the same array. Say for instance that the array is populated with tuple, you could build a sorting for each field. Like the option -k of sort. Just pass a "key" parameter (callback) and you are done :)
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Oct 31, 19:21 UTC, after 1 day of trending.
#19 on Lobsters · Hottest, on Oct 31, 19:21 UTC. Trendoday checks this list every 30 minutes.
It was first seen on Oct 31, 2026 and has been on the list on 1 day (1 check) since.