Program Comics

Blog Post About Github

Graph Algorithms

Dijkstra's Behavior Comic: Learn Dijkstra's with a Comic. Note: this isn't a complete explanation.
Dijkstra's Algorithm: Find the shortest paths between a source vertex and all other vertices in a graph with nonnegative weights. The runtime is O((E + V)log(V)).

Sorting Algorithms

Insertion Sort: Sort a list of comparable elements. The runtime is O(N^2).