View Kamer

Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Standford University)

Wishlist Share
Share Course
Page Link
Share On Social Media

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

Course Content

Module 0: Career Development

  • Career Assessment
    00:00

Module 1: Intro to Course

Module 2: Course Assessment

Module 3: Certification and Ranking

Student Ratings & Reviews

No Review Yet
No Review Yet