Design and Analysis of Algorithms
Design and Analysis of Algorithms
This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.
Duration: Not defined
Level: Undergraduate
Certification: No
Cost: Free
Language: English
Type: Self-Paced
Please note: these courses are provided by external sources, links are not actively managed or regularly updated, content might be moved or unavailable.
