1. To support our site, MoocLab may be compensated by some course providers through affiliate links.
  2. We're here to help you stay connected and progress together. Read about MoocLab's response to COVID-19 ►

    Dismiss Notice

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

Stanford University via coursera

Tags:
  • Overview
  1. Coursera
    Platform:
    Coursera
    Provider:
    Stanford University
    Length:
    4 weeks
    Effort:
    4-8 hours/week
    Language:
    English
    Credentials:
    Paid Certificate Available
    Part of:
    Algorithms | Coursera
    Overview
    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).

    Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.

    Syllabus
    Week 1
    Introduction; "big-oh" notation and asymptotic analysis.

    Week 2
    Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.

    Week 3
    The QuickSort algorithm and its analysis; probability review.

    Week 4
    Linear-time selection; graphs, cuts, and the contraction algorithm.

    Taught by
    Tim Roughgarden

Share This Page



  1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
    By continuing to use this site, you are consenting to our use of cookies.
    Dismiss Notice