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).
Este curso faz parte do Programa de cursos integrados Algoritmos
oferecido por
Informações sobre o curso
Habilidades que você terá
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
oferecido por

Universidade 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.
Programa - O que você aprenderá com este curso
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
Avaliações
- 5 stars83,13%
- 4 stars13,61%
- 3 stars1,83%
- 2 stars0,53%
- 1 star0,87%
Principais avaliações do 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.
This was a super interesting and well-taught course. I thoroughly enjoyed learning about and implementing the algorithms taught. I also enjoyed the abundance of extra material.
I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!
Amazing course. I learned a lot about algorithms, the implementation of algorithms, time complexity. I also learned a lot about being systematic and purposeful about including any line of code.
Sobre Programa de cursos integrados Algoritmos
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.

Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
O que recebo ao me inscrever nesta Especialização?
Existe algum auxílio financeiro disponível?
Mais dúvidas? Visite o Central de Ajuda ao estudante.