This section holds pages that cover algorithms that you might use in your Systems Programming career. This can be anything from A* pathfinding to Quick Sort. Not only will we cover the algorithm in the abstract, we will attempt to link to “real world” implementations of each algorithm. Ideally this can be somewhere in an existing Open Source codebase and/or we might cook up a targeted example repository that you can read. Also many of these pages have interactable widgets to help you explore the concept visually.