Learn the design and analysis of computer algorithms from one of the best universities in computer science. Build your skills in computer algorithms and data structures by enrolling for the Stanford University online course in introduction to the design and analysis of algorithms. Learn the scientific principles surrounding algorithms and data structures, and apply your new skills to any field of computer science.
If you have ever wanted to learn the principles surrounding algorithm design, then this design and analysis of computer algorithms course is for you.
In this introduction to the design and analysis of algorithms 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.
In the computer algorithms introduction to design and analysis course, you will 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?