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: Algorithms
- Category: Probability & Statistics
- Category: Mathematical Theory & Analysis
- Category: Computational Thinking
- Category: Theoretical Computer Science
- Category: Data Structures
- Category: Logical Reasoning
- Category: Design Strategies
- Category: Probability
- Category: Graph Theory
- Category: Analysis
