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).
Offered By
Algorithms SpecializationStanford UniversityAbout this Course
118,070 recent views
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 1 of 4 in the
Intermediate Level
Approx. 17 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Skills you will gain
AlgorithmsRandomized AlgorithmSorting AlgorithmDivide And Conquer Algorithms
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 1 of 4 in the
Intermediate Level
Approx. 17 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Offered by
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.
Syllabus - What you will learn from this course
4 hours to complete
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
4 hours to complete
13 videos (Total 130 min), 3 readings, 2 quizzes
4 hours to complete
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
4 hours to complete
11 videos (Total 170 min), 2 readings, 2 quizzes
4 hours to complete
Week 3
The QuickSort algorithm and its analysis; probability review.
4 hours to complete
9 videos (Total 156 min), 1 reading, 2 quizzes
5 hours to complete
Week 4
5 hours to complete
11 videos (Total 184 min), 3 readings, 3 quizzes
Reviews
TOP REVIEWS FROM DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
by KSSep 13, 2018
Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.
by DTMay 26, 2020
Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime
by FRMar 15, 2017
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
by CVJun 10, 2017
A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.
About the Algorithms Specialization
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.
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.
