Stanford University Online Course Highlights
- 4 weeks long
- 4-8 hours a week
- FREE, Upgradable
- Self-Paced
- Taught by: Tim Roughgarden, Professor
- View Course Syllabus
Online Course Details:
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).
SKILLS YOU WILL GAIN
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
