This online course explores topics such as asymptotic notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Instructor: | Professor Tim Roughgarden |
Provided by: | Coursera |
Course language: | English |
Fees: | free course |
Level: | intermediate |
Certificate available? | (fee) |
Format: | MOOC/online course |
How do you like the course 'Divide and Conquer, Sorting and Searching, and Randomized Algorithms'?