Tags: Algorithms, Computer Science, Divide And Conquer Algorithms, Dynamic Programming, Greedy Algorithm
This course is part of the Data Structures and Algorithms Specialization
University of California San Diego
National Research University Higher School of Economics
About this Course
The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).
Course 1 of 6 in the
Data Structures and Algorithms Specialization
Start instantly and learn at your own schedule.
Reset deadlines in accordance to your schedule.
Approx. 32 hours to complete
Suggested: 5 weeks of study, 4-8 hours/week