Skip to content

This repository was created for an Algorithm Optimization class in the fifth semester of Computer Science.

Notifications You must be signed in to change notification settings

morgsweber/ThePanel

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

The Panel

About the project

This repository was created to develop a university work on Algorithm Optimization using Dynamic Programming. You can find more information about the problem in the T2 file in this repository.

Requirements
Running the project

First, you need compile the project using:

javac Main.java

After, run the project with:

java Main

Then, you will have to input two values, the first one for the number of digits and the second one for the number of "stripes", separated by space. Finally, you will receive the quantity of numbers you can create with the numbers of digits and "stripes" you input.

Observations

The code has three methods:

  • makeAccountRec that implements the solution using just recursion
  • makeAccountRecMem implements the solution using recursion + memory
  • makeAccountMatrix it's not correctly implemented

About

This repository was created for an Algorithm Optimization class in the fifth semester of Computer Science.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages