Science - Course - Design And Analysis Of Algorithms

Techniques For The Design And Analysis Of Efficient Algorithms, Emphasizing Methods Useful In Practice. Topics Include Sorting, Linear Sorting, Search Trees, Heaps, Hashing, Order Statistics, Dynamic Programming, Greedy Algorithms, Amortized Analysis, Graph Algorithms, And Shortest Paths. Advanced Topics May Include Network Flow, Computational Geometry, Number-Theoretic Algorithms, Polynomial And Matrix Calculations.