CSCI 358 - Algorithm, Design, and Analysis

CR: 3
Prerequisites: CSCI 126 and MATH 218 . A rigorous introduction to algorithms and algorithmic efficiency, with an emphasis on asymptotic time and space complexity. Topics include data structures such as hash tables and binary search trees, problems such as searching and sorting, and approaches such as dynamic programming and greedy algorithms.