CS303: Algorithms

Upon successful completion of this unit, you will be able to:

• Describe asymptotic notations for bounding algorithm running times from above and below.
• Explain methods for solving recurrences useful in describing running times of recursive algorithms.
• Explain the use of Master Theorem in describing running times of recursive algorithms.