Algorithms: CLRS in Ruby
summary
Covers concrete implementations: Ruby code for insertion sort (O(n²)), quicksort (typical O(n log n)) and a bucket sort that can be O(n) when distribution is known, plus dynamic programming for longest common subsequence with O(n·m) time and graph algorithms—Prim’s MST and Dijkstra‑style shortest paths using a priority queue (E + V log V with a Fibonacci heap), and Ford‑Fulkerson max flow (O(E·maxflow)). Demonstrations use a Shoes desktop app (which runs) and code lives at gitlab.com/listrophy/clrs-algorithms.
AI-written summary · about
chapters (6)
- 0:00Introduction
- 2:29Complexity theory
- 5:17Sorting algorithms
- 18:00Dynamic programming
- 23:54Graph theory basics
- 31:58Max flow and conclusion
