Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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

Read more.

Career Relevance by Data Role

The techniques and tools covered in Divide and Conquer, Sorting and Searching, and Randomized Algorithms are most similar to the requirements found in Data Scientist job advertisements.


Similarity Scores (Out of 100)

Subscribe for updates and new courses
Or create a DataKwery.com account
Fast Facts
Techniques
AlgorithmsData AnalysisData VisualizationProbability

Similar Opportunities
NP-Complete Problems

edX - University of California, San Diego

Algorithms, Part II

Coursera - Princeton University

Data Structures and Algorithms (I)

Coursera - Tsinghua University

Advanced Algorithms and Complexity

Coursera - National Research University Higher School of Economics

Algorithmic Thinking (Part 1)

Coursera - Rice University

Algorithms and Data Structures Capstone

edX - University of California, San Diego

Data Structures and Algorithms (IV)

Coursera - Tsinghua University