There are both practical and theoretical reasons to study algorithms. From a practical standpoint, you have to know a standard set of important algorithms from different areas of computing; in addition, you should be able to design new algorithms and analyze their efficiency. From the theoretical standpoint, the study of algorithms, sometimes called algorithmics, has come to be as the cornerstone of computer science. This text aims to provide an in-depth understanding of the fundamental algorithmic techniques for design and analysis, in turn impart knowledge and practical competence in use of advanced data structures and the design and analysis of algorithms.
Thumbnail: Flowchart examples of the canonical Böhm-Jacopini structures: the SEQUENCE (rectangles descending the page), the WHILE-DO. (CC BY 3.0; Wvbailey via Wikipedia)
Contributors and Attributions
- Godfry Justo