PaintingFence-Algorithm

Painting Fence Algorithm — Dynamic Programming & Brute Force (C++)

Final team project for SWE212 - Algorithms Analysis and Design [SPRING 2022]

About The Project

The algorithm states that you are given a fence having some posts (some wooden pieces or some other pieces) and some colors. You have to find out the number of ways to paint the fence such that at most only 2 adjacent fences have the same color.

Execution Time

Team Algorithm for DP Approach | Average Execution: 5108 ms

• 4724ms
• 5011ms
• 5295ms
• 4815ms
• 5779ms
• 4733ms
• 5403ms

Team Algorithm for Brute Force Approach | Average Execution: 5798 ms

• 6553ms
• 5651ms
• 5369ms
• 6562ms
• 6578ms
• 4882ms
• 4991ms

Geeks4Geeks Algorithm for DP Approach | Average Execution: 5583 ms

• 5134ms
• 6358ms
• 4696ms
• 5542ms
• 6306ms
• 5890ms
• 5156ms

Contributors

Shady Amr

Ahmed Hossam

Seif Hisham

Mostafa Saleh