Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Rod Cutting Problem #149

Closed
wants to merge 206 commits into from
Closed

Rod Cutting Problem #149

wants to merge 206 commits into from

Conversation

nandikeshsingh
Copy link
Contributor

@nandikeshsingh nandikeshsingh commented Dec 9, 2017

ISSUE NUMBER
This does not have an issue number as by mistake I have sent this PR without discussing on the issue.
But still, it is related to issue number #117 which was not assigned to me.

SHORT DESCRIPTION

Rod Cutting Problem solved using dynamic programming in C++.

TESTING
some inputs with their correct outputs.
input 1: length = 8 , prices : 3 5 8 9 10 17 17 20 output : maximum value = 24
input 2 : length = 5 , prices : 3 5 10 12 14 output : maximum value = 16
input 3 : length = 7, prices : 2 7 8 25 17 28 30 output : maximum value = 34
input 4 : length = 5, prices : 2 3 7 8 10 output : maximum value = 11

manumeral and others added 30 commits November 3, 2015 15:46
Resources for detailed Learning.
Add a Gitter chat badge to README.md
Added a wiki for Dijkstra's Algorithm
Adding solution for RSA algorithm
RSA algorithm implemented in python
RSA Algorithm implemented in python
sgrG24 and others added 23 commits December 7, 2017 10:23
* BackTracking Implementation

* _knights tour_

will PR this later

* delete_knightsTour

* Delete Sudoku.cpp

* Delete nQueen.cpp

* Backtrack
Created a separate 'Python' folder under the cryptography folder and put the implementation of Caesarcipher in that folder.
Also gave a custom input value for key and a custom string for encrypting and decrypting too.
Added a CaesarCipher folder, a python folder inside and inside that my code for the implementation of Caesarcipher(Caesarcipher.py)
{
if(j==0)
temp[i][j]=0;
else if(i==0)
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

document the code

@nandikeshsingh
Copy link
Contributor Author

Documented the code.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet