Course Curriculum

  • Duration00:00:00
  • Lectures0
  • Tests0
  • Pass Percentage70

Similar Courses

People Liked

Courses Home » Browse Courses » Divide and Conquer, Sorting and Searching, and Randomized Algorithms
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 Reviews

    No review have been posted yet.