Algorithms: Design and Analysis, Part 1

SOE-YCSALGORITHMS1

Stanford School of Engineering


Thumbnail

Description

In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

001 Open for Enrollment Online, edX

Enroll Now

Delivery Option:
Online
Fees:
Online Course Free

This course may not currently be available to learners in some states and territories.