Skip to main content

Algorithms: Design and Analysis

Welcome to this course

This is an equal opportunity course that offers you a supportive and inclusive space to learn. Everyone, no matter their age, gender, race, or nationality, can be successful in this course. People like you are joining from all over the world and we value this diversity. We hope you enjoy learning about topics that are important to you.


NEWS:

A new book by the instructor, which is based on the first half of this course, "Algorithms: Design and Analysis", can be found and purchased on Amazon at https://www.amazon.com/dp/0999282905.

The next book in the series, which is based on the second half of this course, can be found and purchased on Amazon at https://www.amazon.com/dp/0999282921.

About This Course

Welcome to the self paced course, Algorithms: Design and Analysis! 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. Specific topics in the course include: "Big-oh" notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), randomized algorithms (QuickSort, contraction algorithm for min cuts), data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of BFS and DFS, connectivity, shortest paths).

Learners will practice and master the fundamentals of algorithms through several types of assessments. There are 6 multiple choice quizzes to test your understanding of the most important concepts. There are also 6 programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. The course concludes with a multiple-choice final. There are no assignment due dates and you can work through the course materials and assignments at your own pace.

Course Staff

Picture of Tim Roughgarden

Tim Roughgarden

Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Frequently Asked Questions

Can I earn a Statement of Accomplishment

Yes. If you successfully complete at least 70% of the graded assignments in the course, you can receive a Statement of Accomplishment.

Do I need to buy a textbook?

No. The instructor has released two books, which can provide one with a deeper understanding of the course material. The readings are suggested, but not required. The readings come from:

  • Algorithms Illuminated (Part 1): The Basics

    A new book by the instructor, which is based on the first half of this course, "Algorithms: Design and Analysis", can be found and purchased on Amazon at https://www.amazon.com/dp/0999282905.

  • Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures (Volume 2)

    The next book in the series, which is based on the second half of this course, can be found and purchased on Amazon at https://www.amazon.com/dp/0999282921.

Icons CCBY: Noun Project Cara Foster, Adrien Coquet

Enroll