Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.


Created by:  Stanford University

Basic Info
Course 3 of 4 in the Algorithms Specialization
LevelIntermediate
Commitment4 weeks of study, 4-8 hours/week
Language
English
How To PassPass all graded assignments to complete the course.
User Ratings
4.9 stars
Average User Rating 4.9See what learners said
Syllabus

FAQs
How It Works
Задания курса
Задания курса

Каждый курс — это интерактивный учебник, который содержит видеоматериалы, тесты и проекты.

Помощь сокурсников
Помощь сокурсников

Общайтесь с тысячами других учащихся: обсуждайте идеи, материалы курса и помогайте друг другу осваивать новые понятия.

Сертификаты
Сертификаты

Получите документы о прохождении курсов и поделитесь своим успехом с друзьями, коллегами и работодателями.

Creators
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Pricing
ПрослушатьПриобрести курс
Получить доступ к материалам курса

Available

Available

Получить доступ к оцениваемым материалам курса

Not available

Available

Получить итоговую оценку

Not available

Available

Earn a shareable Course Certificate

Not available

Available

Ratings and Reviews
Rated 4.9 out of 5 of 226 ratings

Still enjoying it -- looking forward to course 4!

Excellent lectures on Dynamic Programming! The examples chosen in lectures are really typical! I tried to practice on more DP problems on Geeksforgeeks. Surprisingly many DP problems are just extension of the examples gone through in these videos. Reading the CLRS book after watching the lectures become much much easier!

Very good course material with practical implementation.

It was a great course, I really want to thank Tim for another great work.