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.
-
Updated
Aug 7, 2025 - TeX
#
divide-and-conquer
Here are 5 public repositories matching this topic...
Set of problems from the contents of Design and Analysis of Algorithms. Complexity Theory, Dynamic Programming, Greedy, Flow, Divide and Conquer
flow greedy divide-and-conquer dinamic-programming design-and-analysis-of-algorithms np-complete-problems
-
Updated
Feb 21, 2025 - TeX
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.
recursion greedy dynamic-programming divide-and-conquer master-theorem algorithm-design-and-analysis
-
Updated
Feb 11, 2024 - TeX
All assignments for CS 218: Design and Analysis of Algorithms, Spring 2021, IIT Bombay
-
Updated
Apr 16, 2021 - TeX
A Divide-and-Conquer Approach in finding Strongly Connected Components. This is an assignment for the course Design and Analysis of Algorithms(DAA)
-
Updated
Apr 27, 2020 - TeX
Improve this page
Add a description, image, and links to the divide-and-conquer topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the divide-and-conquer topic, visit your repo's landing page and select "manage topics."