Basic strategies of algorithm design: top-down design, divide and conquer, average and worst-case complexity, asymptotic costs, simple recurrence relations. Applications to sorting and searching. Introduction to discrete optimization algorithm: dynamic programming, greedy algorithms.
-
Notifications
You must be signed in to change notification settings - Fork 0
Sntai20/CPSC-5910-Data-Structures
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Basic strategies of algorithm design: top-down design, divide and conquer, average and worst-case complexity, asymptotic costs, simple recurrence relations.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published