Divide and Conquer, Sorting and Searching, and Randomized Algorithms Coursera
Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)

Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)

Divide and Conquer, Sorting and Searching, and Randomized Algorithms is an Online Course, Offered by Stanford University via Coursera.

Enroll In Course

Be ahead to learn something new Today

  • Flexible Online Learning
  • Verified Certificate*
  • Add powers to your Resume
  • Access course Anytime, Anywhere

Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)

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.

Teacher

Tim Roughgarden

Additional information

Course Delivery

Online

Course Efforts

17 hours

Course Enrollment

Free

Course Language

English

Course Length

4 Weeks

Course Level

Intermediate

Course Provider

Course School

Course Subtitles

English, French, Portuguese, Russian, Spanish

Flexible Learning

Yes

Verified Certificate

Paid

Reviews

There are no reviews yet.

Be the first to review “Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)”

Your email address will not be published. Required fields are marked *