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).
Offert par
À propos de ce cours
Compétences que vous acquerrez
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
Offert par

Université de Stanford
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.
Programme de cours : ce que vous apprendrez dans ce cours
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
Avis
- 5 stars83,29 %
- 4 stars13,50 %
- 3 stars1,77 %
- 2 stars0,53 %
- 1 star0,88 %
Meilleurs avis pour DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
I would rate it very high because of the kind of assignments given and kind of questions asked is very very good. I would refer my friends for this kind of professional things.
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
It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.
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
À propos du Spécialisation Algorithmes
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.

Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Une aide financière est-elle possible ?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.