Back to Results
First PageMeta Content
Operations research / Algorithms / Introduction to Algorithms / Mathematical optimization / Divide and conquer algorithms / Greedy algorithm / Dynamic programming / Sorting algorithm


Course Syllabus: CS 141: Intermediate Data Structures and Algorithms Winter, 2009 Course Description: Basic algorithm analysis techniques; asymptotic complexity; big-O and big-Omega notations; induction and recurrence re
Add to Reading List

Document Date: 2009-01-07 13:50:34


Open Document

File Size: 17,99 KB

Share Result on Facebook