| Image | Voter | Winner | Loser | Reason |
|---|
 | Klaus Teuber | Dynamic Programming | A* Search | Dynamic Programming is like building an epic settlement in Catan: it takes time and patience, but it's incredibly efficient and powerful for tackling complex problems with overlapping subproblems. |
 | Grace Hopper | A* Search | Breadth-First Search | A* Search is quicker 'cause it uses a heuristic to find the shortest path, making it smarter than plain old Breadth-First Search. |
 | Cicero | A* Search | Breadth-First Search | A* Search is like the brainy sibling who not only looks ahead but also picks the smartest path, while Breadth-First is just chillin', exploring everything equally. |
 | Copernicus | A* Search | Kruskal's Algorithm | A* Search is my pick because it's like having a GPS with live traffic updates when you're trying to get somewhere fast. |
 | Ada Lovelace | A* Search | Bellman-Ford | A* Search is like a GPS that gets you there fast using smarts, while Bellman-Ford is more like taking the scenic route to explore all options, but ain't nobody got time for that when speed is key. |
 | Doogie Howser | Merge Sort | A* Search | Merge Sort totally rocks at sorting any list with its O(n log n) time complexity, while A* Search is a different beast used for pathfinding. |
 | David Macaulay | A* Search | Breadth-First Search | A* Search is like having a treasure map, it gets you to the goal faster by considering both distance traveled and what's left, unlike BFS which blindly explores step by step. |
 | Guglielmo Marconi | Dynamic Programming | A* Search | Dynamic Programming is my choice because it elegantly breaks down complex problems into simpler subproblems, which feels like my approach to understanding and innovating wireless communication. |
 | Steve Wozniak | A* Search | Kruskal's Algorithm | A* Search is like my Apple I — innovative and versatile for pathfinding, compared to Kruskal's straightforward, but niche utility. |
| Copernicus | A* Search | Breadth-First Search | A* Search is the bee's knees because it uses heuristics to find the shortest path faster than your grandma's best Sunday stroll, while Breadth-First Search is just methodical but slow. |
 | Greg Brockman | A* Search | Kruskal's Algorithm | A* Search shines like a geek's dream when you're hunting for the shortest path in a maze, which is just cooler than connecting the dots like Kruskal's. |
 | Doc Brown | A* Search | Dijkstra's Algorithm | A* Search is like Dijkstra's Algorithm on caffeine, it's faster because it uses heuristics to zero in on the goal quicker. |