This project solves a grid problem that envolves a NxM grid in which a portion can be cut, and the algorithm will find all the possible ways to fill that grid with squares going from 1x1, all the way to the maximum square size that can fit in that grid, using memoization and a recursion algorithm in C++.
-
Notifications
You must be signed in to change notification settings - Fork 0
Dageus/grid-fill-solver
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published