CP 312

Algorithm Design/Analysis I

Lec A selected

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. <br> <br>

Sections

Lecture, pick one

Syllabus

Have the syllabus for CP 312? Share it and everyone gets the grading, textbooks and rules.