Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by TRAN DANG MINH NGUYEN
December 8, 2024
15 hours (approximately)
TRAN DANG MINH NGUYEN's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
- Category: Design Strategies
- Category: Computational Thinking
- Category: Logical Reasoning
- Category: Probability & Statistics
- Category: Mathematical Theory & Analysis
- Category: Algorithms
- Category: Theoretical Computer Science
- Category: Data Structures
- Category: Probability
- Category: Graph Theory
- Category: Analysis
