Divide and Conquer Algorithms

Apr 29th 2024

Course Auditing

Coursera

University of Colorado Boulder

Categories

Effort

Languages

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data [...]

Data Structures and Algorithms Specialization

Dynamic Programming

Greedy Algorithms

Divide and Conquer Algorithms

Apr 29th 2024

Course Auditing

Coursera

University of Colorado Boulder

68.00 EUR/month

Self Paced

Course Auditing

EdX

Georgia Institute of Technology

Categories

Effort

Languages

Learn more complex tree data structures, AVL and (2-4) trees. Investigate the balancing techniques found in both tree types. Implement these techniques in AVL operations. Explore sorting algorithms with simple iterative sorts, followed by Divide and Conquer algorithms. Use the course visualizations to understand the [...]

Data Structures and Algorithms Professional Certificate

Divide and Conquer Algorithms

AVL Trees