Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Tomas Bielskis
April 27, 2017
15 hours (approximately)
Tomas Bielskis's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
- Category: Theoretical Computer Science
- Category: Graph Theory
- Category: Data Structures
- Category: Probability
- Category: Design Strategies
- Category: Computer Science
- Category: Mathematical Theory & Analysis
- Category: Computational Thinking
- Category: Analysis
- Category: Probability & Statistics
- Category: Algorithms
