IBibobev·Mar 7, 2026Submission
2 points · Open discussionlittle-book-of
algorithms
TeX2025–2026
little-book-of / algorithms
algorithms
Bake a cake with care, follow steps the recipe gives, that’s an algorithm.
2Distinct people
2Mentions
0Explicit recommenders
564GitHub stars
What to know before exploring
What it is
Bake a cake with care, follow steps the recipe gives, that’s an algorithm.
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, 5:04:57 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: 2025-10-13 04:09:58 UTC to 2026-03-07 04:03:49 UTC. Weeks start Monday, UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| Oct 13 | 2025-10-13 00:00:00 UTC | 2025-10-20 00:00:00 UTC | 1 | 0 | 1 |
| Oct 20 | 2025-10-20 00:00:00 UTC | 2025-10-27 00:00:00 UTC | 0 | 0 | 0 |
| Oct 27 | 2025-10-27 00:00:00 UTC | 2025-11-03 00:00:00 UTC | 0 | 0 | 0 |
| Nov 3 | 2025-11-03 00:00:00 UTC | 2025-11-10 00:00:00 UTC | 0 | 0 | 0 |
| Nov 10 | 2025-11-10 00:00:00 UTC | 2025-11-17 00:00:00 UTC | 0 | 0 | 0 |
| Nov 17 | 2025-11-17 00:00:00 UTC | 2025-11-24 00:00:00 UTC | 0 | 0 | 0 |
| Nov 24 | 2025-11-24 00:00:00 UTC | 2025-12-01 00:00:00 UTC | 0 | 0 | 0 |
| Dec 1 | 2025-12-01 00:00:00 UTC | 2025-12-08 00:00:00 UTC | 0 | 0 | 0 |
| Dec 8 | 2025-12-08 00:00:00 UTC | 2025-12-15 00:00:00 UTC | 0 | 0 | 0 |
| Dec 15 | 2025-12-15 00:00:00 UTC | 2025-12-22 00:00:00 UTC | 0 | 0 | 0 |
| Dec 22 | 2025-12-22 00:00:00 UTC | 2025-12-29 00:00:00 UTC | 0 | 0 | 0 |
| Dec 29 | 2025-12-29 00:00:00 UTC | 2026-01-05 00:00:00 UTC | 0 | 0 | 0 |
| Jan 5 | 2026-01-05 00:00:00 UTC | 2026-01-12 00:00:00 UTC | 0 | 0 | 0 |
| Jan 12 | 2026-01-12 00:00:00 UTC | 2026-01-19 00:00:00 UTC | 0 | 0 | 0 |
| Jan 19 | 2026-01-19 00:00:00 UTC | 2026-01-26 00:00:00 UTC | 0 | 0 | 0 |
| Jan 26 | 2026-01-26 00:00:00 UTC | 2026-02-02 00:00:00 UTC | 0 | 0 | 0 |
| Feb 2 | 2026-02-02 00:00:00 UTC | 2026-02-09 00:00:00 UTC | 0 | 0 | 0 |
| Feb 9 | 2026-02-09 00:00:00 UTC | 2026-02-16 00:00:00 UTC | 0 | 0 | 0 |
| Feb 16 | 2026-02-16 00:00:00 UTC | 2026-02-23 00:00:00 UTC | 0 | 0 | 0 |
| Feb 23 | 2026-02-23 00:00:00 UTC | 2026-03-02 00:00:00 UTC | 0 | 0 | 0 |
| Mar 2 | 2026-03-02 00:00:00 UTC | 2026-03-09 00:00:00 UTC | 1 | 1 | 0 |
What Hacker News says
2 sourcesI am working on the little book of algorithms:
https://github.com/little-book-of/algorithms
A project to implement 1000 algorithms. I have finished around 400 so far and I am now focusing on adding test cases, writing implementations in Python and C, and creating formal proofs in Lean.
It has been a fun way to dive deeper into how algorithms work and to see the differences between practical coding and formal reasoning. The long-term goal is to make it a solid reference and learning resource that covers correctness, performance, and theory in one place.
The project is still in its draft phase and will be heavily edited over the next few months and years as it grows and improves.
If anyone has thoughts on how to structure the proofs or improve the testing setup, I would love to hear ideas or feedback.
In Ask HN: What are you working on? (October 2025)