Coursera
MOOC / Non-credit
0
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
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).
C
67/100
CourseAsk score
- What the provider tells you
- 16/45
- Who stands behind it
- 35/35
- How complete the listing is
- 16/20
Scores how much the provider publishes and who stands behind it — not how well it is taught.
What you'll learn
- understand and apply Big-oh notation
- implement sorting algorithms
- utilize searching methods
- apply divide and conquer strategies
- understand randomized algorithms like QuickSort
Machine Learning
#algorithms
#sorting
#searching
#big-oh
#divide and conquer
#randomized algorithms
#quicksort
#matrix multiplication
#closest pair
#master method
$79.00
Price shown by Coursera — confirm on their site.
Enroll on CourseraYou'll be redirected to Coursera to complete enrollment.
- Listed & compared by CourseAsk
- English · 0
Udemy
Coursera
Compared on these lists
Where this course ranks against the alternatives.