COSC 6385 Analysis Of Algorithms

A study of efficient algorithms for a variety of problems, with mathematical proof of correctness and analysis of space and time complexities. Topics include upper bound, lower bound, and average case analysis for sorting, amortized analysis of data structures, tree and graph algorithms, parallel algorithms, and NP-completeness.