Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which as conceived by Edsger W. Dijkstra in 1956. The original version of the algorithm found the shortest path between two nodes, but the more common version found the shortest paths between a "source" node and all other nodes of… Continue reading Why did Dijkstra cross the road? Cuz it was the shortest path!
Just like spiders, bits are everywhere. Even though we don't necessarily work with bits directly, you'd be surprised where you might encounter bits. Let's talk about 01100010 01101001 01110100 01110011, baby Well, what is a bit? The bit is a basic unit of computation, which is commonly represented as a 0 or 1. When we think… Continue reading The Itsy BITsy Spider
In a couple of weeks, I will be starting the February 6, 2016 cohort of The Flatiron School, which is a 12-week coding bootcamp in New York City. So thousands of dollars later and the prospect of spending many hours learning, training, and coding with other students, the end goal becoming a software developer (with… Continue reading Journey to Code: The Flatiron School