IIRF Online > Development > Software Engineering > Algorithms > StanfordOnline: Algorithms: Design and Analysis, Part 1
StanfordOnline: Algorithms: Design and Analysis, Part 1 by Edx
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.
Course Highlights
- "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)
Skills you will learn!
StanfordOnline: Algorithms: Design and Analysis, Part 1
Related Algorithms Courses
Thank You!
Your review has been submitted successfully.