Further technical explanation for solving the algorithm is on "Solution" file. This project used recursion and the CS top down memoization approach to achieve a good time complexity. Main is the main file of the project where it uses the functions and calls the defined algorithm in "algoritmo.c", also the predefined functions, libraries and its initializations where made on "funciones".
-
Notifications
You must be signed in to change notification settings - Fork 0
ManuelAAM/Dynamic-Algorithm-Design
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Efficient C-based algorithm using dynamic programming and recursive functions to solve the "Minimum Cost to Cut a Stick" problem.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published