Coursera
Coursera Logo

Stanford University - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 

  • Offered byCoursera

Divide and Conquer, Sorting and Searching, and Randomized Algorithms
 at 
Coursera 
Overview

Duration

13 hours

Mode of learning

Online

Difficulty level

Intermediate

Credential

Certificate

Divide and Conquer, Sorting and Searching, and Randomized Algorithms
 at 
Coursera 
Highlights

  • Earn a Certificate on successful course completion from The Stanford University
  • Get unlimited access to the course content
  • Graded Assignments with Peer Feedback
  • Shareable Specialization and Course Certificates
  • 26 % Got a pay increase or promotion.
  • 36 % Started a new career after completing this specialization
  • Applied Learning project from Qwiklabs
Read more
Details Icon

Divide and Conquer, Sorting and Searching, and Randomized Algorithms
 at 
Coursera 
Course details

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

Divide and Conquer, Sorting and Searching, and Randomized Algorithms
 at 
Coursera 
Curriculum

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

Other courses offered by Coursera

– / –
3 months
Beginner
– / –
20 hours
Beginner
– / –
2 months
Beginner
– / –
3 months
Beginner
View Other 6715 CoursesRight Arrow Icon
qna

Divide and Conquer, Sorting and Searching, and Randomized Algorithms
 at 
Coursera 

Student Forum

chatAnything you would want to ask experts?
Write here...