Techniques for algorithm design: divide-and-conquer, greedy, dynamic programming, and randomization. Analysis of recursive algorithms through recurrence relations. The design and implementation of common algorithms such as sorting and selection. STAT 1000 or STAT 1001 or STAT 1150 is recommended [3 credits]
Techniques for algorithm design: divide-and-conquer, greedy, dynamic programming, and randomization. Analysis of recursive algorithms through recurrence relations. The design and implementation of common algorithms such as sorting and selection. STAT 1000 or STAT 1001 or STAT 1150 is recommended [3 credits]
