Divide and Conquer, Sorting and Searching, and Randomized Algorithms
SOE-YCS0009
Description
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).
Who Should Enroll
Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Time Commitment
4 weeks of study, 4-8 hours/week
Instructor
Tim Roughgarden, Professor of Computer Science
| Delivery Option: |
Online
|
|---|
| Online Course | Free |
|---|
Coursera Course Certificate Available for a Fee
You can earn a Course Certificate for this Coursera Course. A Course Certificate is proof that you completed and passed the course.
In order to get a Course Certificate, you must:
- Complete ID Verification, which includes submitting a photo and verified ID
- Pass all required assignments in the course
- Pay the Course Certificate fee, or apply and be approved for Coursera Financial Aid
This course may not currently be available to learners in some states and territories.
