Coursera - Stanford University - Design and Analysis of Algorithms I
VP80 | English | 960x540 | WebM | 15 fps | 768 MB
Genre: eLearning
Description:
In this run after you will learn several fundamental principles of algorithm design. You'll learn the allot-and-conquer design paradigm, with applications to deep sorting, searching, and multiplication. You'll learn single blazingly fast primitives for computing forward graphs, such as how to estimate connectivity information and shortest paths. Finally, we'll study to what degree allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions so as: How do data structures like heaps, hash tables, bloom filters, and balanced inquiry trees actually work, anyway? How tend hitherward QuickSort runs so fast? What be able to graph algorithms tell us about the formation of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm towards multiplying two numbers?
No comments:
Post a Comment