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