Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Coursera MOOC / Non-credit USD 79
Enroll now →
Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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

What you'll learn

  • understand and apply Big-oh notation
  • implement sorting algorithms
  • utilize searching methods
  • apply divide and conquer strategies
  • understand randomized algorithms like QuickSort

Skills you'll gain

Related courses

Course details are provided by the platform and may change — always confirm on the provider's site. Links may be affiliate links.