HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
scandum
gridsort
C2021–2021
scandum / gridsort

gridsort

A stable adaptive partitioning comparison sort.

Explore on GitHubRead Hacker News discussions
2Distinct people
2Mentions
0Explicit recommenders
210GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A stable adaptive partitioning comparison sort.

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 1:49:46 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by week2 dated mentions

Observed mentions: 2021-02-08 10:41:36 UTC to 2021-07-10 18:04:22 UTC. Weeks start Monday, UTC.

012021-02-08 00:00:00 UTC to 2021-02-15 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsFeb 82021-02-15 00:00:00 UTC to 2021-02-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-02-22 00:00:00 UTC to 2021-03-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-03-01 00:00:00 UTC to 2021-03-08 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-03-08 00:00:00 UTC to 2021-03-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-03-15 00:00:00 UTC to 2021-03-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-03-22 00:00:00 UTC to 2021-03-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-03-29 00:00:00 UTC to 2021-04-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-04-05 00:00:00 UTC to 2021-04-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-04-12 00:00:00 UTC to 2021-04-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-04-19 00:00:00 UTC to 2021-04-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsApr 192021-04-26 00:00:00 UTC to 2021-05-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-05-03 00:00:00 UTC to 2021-05-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-05-10 00:00:00 UTC to 2021-05-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-05-17 00:00:00 UTC to 2021-05-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-05-24 00:00:00 UTC to 2021-05-31 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-05-31 00:00:00 UTC to 2021-06-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-06-07 00:00:00 UTC to 2021-06-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-06-14 00:00:00 UTC to 2021-06-21 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-06-21 00:00:00 UTC to 2021-06-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-06-28 00:00:00 UTC to 2021-07-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-07-05 00:00:00 UTC to 2021-07-12 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJul 5

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Feb 82021-02-08 00:00:00 UTC2021-02-15 00:00:00 UTC110
Feb 152021-02-15 00:00:00 UTC2021-02-22 00:00:00 UTC000
Feb 222021-02-22 00:00:00 UTC2021-03-01 00:00:00 UTC000
Mar 12021-03-01 00:00:00 UTC2021-03-08 00:00:00 UTC000
Mar 82021-03-08 00:00:00 UTC2021-03-15 00:00:00 UTC000
Mar 152021-03-15 00:00:00 UTC2021-03-22 00:00:00 UTC000
Mar 222021-03-22 00:00:00 UTC2021-03-29 00:00:00 UTC000
Mar 292021-03-29 00:00:00 UTC2021-04-05 00:00:00 UTC000
Apr 52021-04-05 00:00:00 UTC2021-04-12 00:00:00 UTC000
Apr 122021-04-12 00:00:00 UTC2021-04-19 00:00:00 UTC000
Apr 192021-04-19 00:00:00 UTC2021-04-26 00:00:00 UTC000
Apr 262021-04-26 00:00:00 UTC2021-05-03 00:00:00 UTC000
May 32021-05-03 00:00:00 UTC2021-05-10 00:00:00 UTC000
May 102021-05-10 00:00:00 UTC2021-05-17 00:00:00 UTC000
May 172021-05-17 00:00:00 UTC2021-05-24 00:00:00 UTC000
May 242021-05-24 00:00:00 UTC2021-05-31 00:00:00 UTC000
May 312021-05-31 00:00:00 UTC2021-06-07 00:00:00 UTC000
Jun 72021-06-07 00:00:00 UTC2021-06-14 00:00:00 UTC000
Jun 142021-06-14 00:00:00 UTC2021-06-21 00:00:00 UTC000
Jun 212021-06-21 00:00:00 UTC2021-06-28 00:00:00 UTC000
Jun 282021-06-28 00:00:00 UTC2021-07-05 00:00:00 UTC000
Jul 52021-07-05 00:00:00 UTC2021-07-12 00:00:00 UTC101

What Hacker News says

2 sources
scandum·Jul 10, 2021
Well, blitsort's performance is exceptional in the sense that it's 15% faster than the next fastest stable in-place sort. As for stability, it's useful when you need to sort a table with an integer index. So it might be of value to database software. I probably should point out some of the weakness on the README. Agreed on pdqsort being 3x slower worst case on "killer" input, but it's my understanding that's why it's not being used to replace std::sort. As for runs of 50, haven't benched those, though I assume gridsort (https://github.com/scandum/gridsort) would handle those rather well.
In Blitsort is an in-place stable adaptive rotate merge sort

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.