Answers for exercises from the Design and Analysis of Algorithms course at the university. Discover efficient C++ implementations of algorithms, data structures, and problem-solving strategies.
Set of problems from the contents of Design and Analysis of Algorithms. Complexity Theory, Dynamic Programming, Greedy, Flow, Divide and Conquer
All assignments for CS 218: Design and Analysis of Algorithms, Spring 2021, IIT Bombay
A Divide-and-Conquer Approach in finding Strongly Connected Components. This is an assignment for the course Design and Analysis of Algorithms(DAA)
Comparison of brute-force and divide & conquer solutions for the Domino Tiling Problem (2×n board with 2×1 dominoes). Includes a research paper and a visualizer.
Add a description, image, and links to the divide-and-conquer topic page so that developers can more easily learn about it.
To associate your repository with the divide-and-conquer topic, visit your repo's landing page and select "manage topics."