YoVDO

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Offered By: Stanford University via Coursera

Tags

Algorithms and Data Structures Courses QuickSort Courses Algorithms Courses Asymptotic Notation Courses Divide and Conquer Algorithms Courses Randomized Algorithms Courses

Course Description

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).

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

Tags

Related Courses

Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera Biology Meets Programming: Bioinformatics for Beginners
University of California, San Diego via Coursera Finding Hidden Messages in DNA (Bioinformatics I)
University of California, San Diego via Coursera Algorithms for Big Data
Indian Institute of Technology Madras via Swayam Introduction to Genomic Data Science
University of California, San Diego via edX