Source code online books for professionals by professionals

Ore’s algorithm. An algorithm for traversing actual mazes in person, by marking passage entries and exits. In many 
ways similar to iterative deepening DFS or BFS. (See Chapter 5.)
Prim’s algorithm. Grows a minimum spanning tree by repeatedly adding the node closest to the tree. It is, at core, a 
traversal algorithm and uses a priority queue, just like Dijkstra’s algorithm. (See Listing 7-5.)
Radix sort. Sorts numbers (or other sequences) by digit (element), starting with the least significant one. As long as 
the number of digits is constant and the digits can be sorted in linear time (using, for example, counting sort), the total 
running time is linear. It’s important that the sorting algorithm used on the digits is stable. (See Chapter 4.)