Skip to content
CourseAsk.
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Coursera MOOC / Non-credit all levels

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Stanford University

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

$79.00

Price shown by Coursera — confirm on their site.

Enroll on Coursera

You'll be redirected to Coursera to complete enrollment.

  • Listed & compared by CourseAsk
  • English · All Levels

More courses from Coursera

TCP/IP and Internet Coursera

TCP/IP and Internet

Birla Institute of Technology & Science, Pilani · MOOC / Non-credit

New
$49
Agile Project Management Coursera

Agile Project Management

University of Colorado Boulder · Master's Degree

New
$99
Conservation and Sustainable Development Coursera

Conservation and Sustainable Development

University of Michigan · MOOC / Non-credit

New
$49
Extra-Galactic Astronomy Coursera

Extra-Galactic Astronomy

University of Cambridge · MOOC / Non-credit

New
$49