Interested in online learning?

Edukatico will keep you updated from time to time. (You can stop this at any time.)

Coursera logo
Provider: Coursera
Go to online course
Transparency note: Some course providers support the operation of our search portal with referral commissions.

Content

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

Stanford University

Teacher: Professor Tim Roughgarden
Provided by: Coursera
Course language: English
Fees: free course
Level: intermediate
Certificate possible? (fee)
Format: MOOC/online course
Go to online course
Transparency note: Some course providers support the operation of our search portal with referral commissions.

How do you like the course 'Divide and Conquer, Sorting and Searching, and Randomized Algorithms'?

Other online courses in Computer Science, IT