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