Back to projects
Oct 24, 2017
1 min read

Legacy · Project archive

Algorithms, made interactive

A Python desktop application exploring optimization, graph algorithms, recursion, and sorting through a Tkinter interface.

Browser adaptation · 2026

Explore sorting in motion with quicksort, heapsort, and a bubble-sort comparison. Step through actual comparisons and swaps. In the shortest-path lab, edit edge weights and inspect Dijkstra’s frontier, routes, and distances or Floyd–Warshall’s all-pairs matrix. These are new visualizations extending the original Python/Tkinter explorations.

Open the interactive demo.

Credits and scope

The 2017 project credits Andrés Brenes, Axel Fernández, and Iván López. Original individual file ownership is not asserted. The new browser code separates the visualizations from the historical desktop implementation.

Historical source

Original repository. The archive preserves the earlier project.