Divide and Conquer, Sorting and Searching, and Randomized Algorithms

This course is part of Algorithms Specialization

Instructor: Tim Roughgarden

Skills you'll gain

  •   Programming Principles
  •   Probability & Statistics
  •   Theoretical Computer Science
  •   Data Structures
  •   Graph Theory
  •   Analysis
  •   Algorithms
  •   Computational Thinking
  •   Probability
  • There are 4 modules in this course

    The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).

    Week 2

    Week 3

    Week 4

    Explore more from Algorithms

    ©2025  ementorhub.com. All rights reserved