The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Этот курс входит в специализацию ''Специализация Алгоритмы'
от партнера
Об этом курсе
Приобретаемые навыки
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
от партнера

Стэнфордский университет
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.
Программа курса: что вы изучите
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
Week 3
The QuickSort algorithm and its analysis; probability review.
Week 4
Рецензии
- 5 stars83,29 %
- 4 stars13,48 %
- 3 stars1,79 %
- 2 stars0,53 %
- 1 star0,88 %
Лучшие отзывы о курсе DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
This was going to be a review of material for me, just a refresher. But instead I was exposed to a lot of new concepts and really feel like I got some good experience from it.
Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec
This course is awesome and a bit challenging. The special part is about the problem quizzes which is about the running time analyses of the algorithms. And the professor is superb :-)
Professor Tim is an amazing instructor, and he explained all those elegant proofs in a brief and concise manner. I really enjoyed this course and certainly felt my IQ level going above roof ! :P
Специализация Алгоритмы: общие сведения
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оформив подписку на специализацию?
Можно ли получить финансовую помощь?
Остались вопросы? Посетите Центр поддержки учащихся.