it used to be so fucking easy to get your name immortalized in computer science dude. dijkstra's algorithm and the fisher-yates shuffle are literally just the first thing i would try
ME: i need to write a shuffler i know there's an algorithm for it i wonder if it does anything special
FISHER AND/OR YATES: have you tried randomly swapping items in the array
ME:
ME: i need to find the shortest path between these nodes on this graph, i wonder what insight edsger dijkstra has to offer
EDSGER DIJKSTRA: have you considered checking the closest nodes first
ME:
I invented linked lists independently of anyone else before I even knew what they were!
mark and sweep garbage collection is literally just mark everything that's reachable and delete anything else.
maybe no one had considered doing garbage collection before, but as soon as you do that is the most basic possible algorithm
