Algorithm design and analysis. Simple Sorting and Searching Algorithms. Theory of NP completeness and tools for analyzing efficiency; Design of data structures, insert, search and delete functions. Advanced Sorting and Searching Algorithms, including recurrence, divide-and-conquer, dynamic programming, and greedy algorithms. Trees and graph algorithms. Pre-req.: COMP 232.