It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Dynamic programming algorithms are a good place to start understanding what's really going on inside computational biology software. The heart of many well-known programs is a dynamic programming ...

Specialization: Data Science Foundations: Data Structures and Algorithms Instructor: Sriram Sankaranarayanan, Assistant Professor Prior knowledge needed: We highly recommended successfully completing ...

Topics include program design, algorithm design, number systems, classes and objects, methods (functions), control structures, arrays, and interactive input/output. Lecture two hours, technical ...