|
Course Discription |
:
The design and analysis of computer algorithms, growth of functions, recurrences, sorting, divide-and-conquer, binary search tree, red black tree, dynamic programming, greedy algorithms, graph searching and graph algorithms, flow networks, bipartite matching, NP-completeness. |