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.
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
