CPTR 454 Design and Analysis of Algorithms

Design and analysis of efficient algorithms for sorting, searching, and other applications. Students will design algorithms using techniques such as divide-and-conquer, greedy algorithms, and dynamic programming; and give proofs of correctness for their algorithms. Students will also analyze an algorithm's time and space complexity and give examples of NP-complete and NP-hard problems.