A Not-Too-Short Summary of Algorithms#
Author: Igor L.R. Azevedo - The University of Tokyo & University of Brasilia
Email: igorlima1740@gmail.com
GitHub: https://github.com/igor17400/algorithms-174
WHAT TO EXPECT:
This work aims to deliver, as the title suggests, a summary of algorithms that strikes a balance—not too short, yet not overly detailed like a comprehensive textbook. My intention was to explore essential algorithms in computer science with more depth than a typical summary offers, yet not as extensively as a canonical textbook. While this isn’t just a collection of info-graphics or codes, it also isn’t a divine manuscript descended from the heavens (CLRS book - “Introduction to Algorithms”). Ultimately, I hope this proves useful to someone beyond myself. If you’ve read this far, thank you, and stay safe!
COLOR GUIDE:
This document uses four colors to convey specific types of information:
Color 1 - Indicates super important information, memorize it!
Color 2 - Used exclusively for arrows, which signify important details, curiosities, or useful symbols and information.
Color 3 - Marks important information designed to catch your attention.
Color 4 - Reserved for citations, links, lines, and other objects.