A simple clustering algorithm for lists
The article discusses a simple clustering algorithm inspired by sorting techniques used with physical objects. The author describes a method for clustering list values by reversing sub-lists based on their proximity to the end of the list. While the algorithm is not the most efficient, it presents an interesting approach to grouping elements.
- ▪The algorithm clusters list values by reversing sub-lists based on identical elements.
- ▪It has a time complexity of O(n^2) due to nested loops.
- ▪The author compares the algorithm to pancake sorting, noting similarities in concepts.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Cassidoo |
| Canonical URL | https://cassidoo.co/post/clustering-tiles/ |
| Publication time | Mon, 25 May 2026 07:41:51 +0000 |
| Retrieval time | 2026-05-25T08:07:36.528Z |
| Last seen | 2026-05-25T08:07:36.528Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 1IektD1FFCIs |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
A simple clustering algorithm for lists May 24, 2026 #technical #learning I’ve been experimenting with a human-friendly way to cluster list values using reversals of sub-lists. Or, in normal human words: I was playing with my toddler’s Magna-Tiles and got into a pattern with how I was sorting and grouping them, and turned it into a little… algorithm? Heuristic? Anyway, look! Here’s a video I made for reference: But if you prefer words over video: Let’s say you have a list where node values can be b, g, o, or r. Initial state: bgogbrbroorrgbgorrbggo What you do is you take the value that’s at the end (in this case o), and you find the next value closest to the end with that same value, and you reverse the sub-list between them.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Cassidoo.
Discussion
0 commentsMore from Cassidoo
