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.

This is a 4 part specialization, thought by Tim Roughgarden from the Stanford University. #

Synapse from the course description: #

Divide and Conquer, Sorting and Searching, and Randomized Algorithms #

Graph Search, Shortest Paths, and Data Structures #

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming #

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them #