|
I guess it's basically re-writing the code from this current way (the recursion method) to a for-loop way, I've nothing more to say tbh 
If you can help me re-writing this code because I'm unfortunately not that good with programming at the moment, I'm still learning some basics.
|
|
|
|
|
iNoor72 wrote: I'm still learning some basics.
And you'll be stuck there by continuing with this paradigm. Do the work yourself. Only ask for help after you have exhausted all other resources!
"One man's wage rise is another man's price increase." - Harold Wilson
"Fireproof doesn't mean the fire will never come. It means when the fire comes that you will be able to withstand it." - Michael Simmons
"You can easily judge the character of a man by how he treats those who can do nothing for him." - James D. Miles
|
|
|
|
|
iNoor72 wrote: but I want someone to re-write the code in a normal form (For loops, while loops, etc...)
Good plan.
There are some different ways to do that:
- The "naive" way: iterate over all sets. That's easy, because sets can represented as integers, where bit
i being set means "item i is in the set" and bit i not being set meaning "item i is not in the set". Iterating over ranges of integers, well, that's just a normal loop. Slow but simple. Simple in terms of code at least. There is a certain leap of logic to it (set=integer) that is not obvious for beginners. - The "mechanical" way: traverse the same recursion-tree, but with iteration and an explicit stack. That's a straightforward refactoring, just tricky (for a human) to get right. Hypothetically this refactoring could be done by a computer, so I call it mechanical - it doesn't require any insight in the Knapsack problem.
- The "clever" way: fill an array iteratively, so that every result for a unique combination of
(n, W) is only computed once, starting with the bottom of the recursion-tree and working up. The original algorithm will often reach the same state through different paths and then recalculate the same thing, that wasted work is avoided this way. This is also known as "Dynamic Programming", which is a far too fancy term for what it is..
Any way you go with, you should be able to make some sort of progress. If you can't finish it then you would have a real question to ask - or to look up. Knapsack has been done to death, there are already too many introductory articles about it, there have to be some that will help you.
|
|
|
|
|
Could you implement any of these ways and show me how it's done? Because I understood some of the things you've said but the rest I couldn't tbh
|
|
|
|
|
As I wrote already, there are many articles about it. There are articles on this very website, for example Knapsack Bitwise. geeksforgeeks.org has articles about it. The wikipedia article is so complete that you can implement it straight from there. Medium.com is spammed full of Knapsack articles, just about any programmer transitioning from beginner to intermediate feels qualified to write them. You can read any of them, or any other articles about the subject, you don't need me - not yet. When you've tried it, and you still need help, then let's talk about it.
|
|
|
|
|
I've read a lot of articles believe me, I wouldn't ask for help re-writing the code if I didn't check every possible solution or article, that's why I'm asking for someone to re-write it to see how can I:
1- re-write recursion code to non-recursion code.
2- non-recursion solution for the knapsack problem.
|
|
|
|
|
iNoor72 wrote: I'm asking for someone to re-write it
You keep saying this but you refuse to understand that nobody is going to do your work for you. Do you have any idea how times a day people show up here and ask to have someone do their homework for them?
IT'S NOT GOING TO HAPPEN.
You cannot just "rewrite this code as a for loop". That doesn't work at all. Forget the code you have and start over using the resources you've been given.
|
|
|
|
|
Are you saying that you want the recursive solution rewritten into a non-recursive one?
Then you have two main alternatives: Either find a completely different algorithm for solving the same task.
Or do it by recursion, by maintaining your own recursion stack, e.g. in an array. The only reason for doing it that way would be because your programming language doesn't allow recursion - but I haven't seen that limitation since the days of Fortran 
I'll admit you a secondary reason for being a little careful with recursion: If your estimate for maximum recursion depth is way off, you may experience a stack overflow. In principle, you have the same situation with your array-as-recursion stack, but as you explicitly move stack pointers (i.e. calculate array indexes), it will be far more visible to you, so that you can avoid a fatal crash. You may set up an exception handler for a "real" stack overflow as well, but usually you have a hard time getting back onto your feet with no loss of data or code flow.
|
|
|
|
|
I've read that any recursion program can be written in non-recursion manner unless there's dynamic allocation in that recursion method, and I want to apply that on this particular code because I tried doing it by myself but again, not having a good programming background made me stop and couldn't do it myself.
|
|
|
|
|
iNoor72 wrote: not having a good programming background made me stop
So now would be a good time to learn programming properly, rather than trying to rewrite something that you do not understand.
|
|
|
|
|
Trying to evade the problem that you don't understand recursion by rewriting it to non-recursion is never going to work.
In my university days, a fellow student realized that he did not fully master recursion - termination in particular. So he defined a small programming problem for himself. After solving the task, he never had any problems with how to terminate a recursion. I think he made an excellent "programming etude", and have spread it out to a lot of people. It goes like this:
When you enter the recursive function, you write a line with the number of spaces given by the recursion depth, and then an asterisk. When you leave the recursive function, you do the same. The top level call gives parameters for (a) the maximum recursion depth, which you dive right into, (b) an intermediate recursion depth that you return to, before again recursing to the maximum depth, and (c) the number of times to recurse to the maximum depth and back to the intermediate level, before finally returning to the top level call (i.e. the number of "peaks").
For a call with arguments (5, 3, 3) the ouput should look something like
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*The problem statement seems very simple (and it is, for a seasoned recursionist). For an inexperienced programmer, you can usually hear a lot of cursing and re-cursing during the testing
|
|
|
|
|
I don't think that message was meant for me.
|
|
|
|
|
Pass it up the recursion stack! 
Software rusts. Simon Stephenson, ca 1994. So does this signature. me, 2012
|
|
|
|
|
No, it was meant as a side-by-side answer to yours, supporting what you wrote.
So it was primarily meant for the originial poster. But it is a good exercise in recursion. Lots of (even experienced) programmers are touching recursion only occasionally, and then often in a quite simplistic way. So I propose it to any programmer.
If you think it so trivial that you can do it ten minutes, then spend those ten minutes proving to yourself that you master recursion. I have met several experienced programmers who thought it would be simple and straightforward, but experienced it to be "somewhat more tricky" than they at first thought it would be.
|
|
|
|
|
Very interesting, but the person that the message was meant for is unlikely ever to see it.
|
|
|
|
|
If only five other people read it, say "Hey, that I can do in ten minutes", go ahead to show it and they are still fiddeling around with termination conditions after half an hour, I think it has been worth it.
You are probably right about the original poster, and nothing seems to indicate that he will be ready to take on the task for some time.
|
|
|
|
|
Member 7989122 wrote: say "Hey, that I can do in ten minutes"
Making such statements is guaranteed to cause failure. I have done plenty of basic recursion functions but never anything very complicated. So I understand the concept, but the practical application always requires considerable thought.
|
|
|
|
|
Member 7989122 wrote: When you enter the recursive function, you write a line with the number of spaces given by the recursion depth, and then an asterisk. When you leave the recursive function, you do the same.
If the first value is 5 then the first line should be 5 spaces and then the asterisk, then 4 spaces asterisk ... (ignoring the second two parameters).
*
*
*
*
*
*
*
*
*
*
*
|
|
|
|
|
I'd like to see the code.
|
|
|
|
|
I made my solution 35+ years ago, and the source might still exist on one of the approx 100 eight-inch floppy disks, with a proprietary formatting and a proprietary file system, that I'm still keeping in a box in my basement. The manufacturer went bankrupt in 1992. I think that we were programming in Pascal at that time, so I would have to obtain a Pascal compiler to verify the code.
The cost&effort of recovering the source code (if it is available on one of the floppies, and the floppy is still readable) would be much larger than the cost of developing it anew. I could do it; you could do it yourself. The solution is really tiny, but the devil is in the details. Once the details are right, you'll say: Well, of course that's how it should be.
I might give it a try (maybe 35+ years of coding experience will make it appear simpler), but I haven't got the time right now. Go ahead yourself!
|
|
|
|
|
Member 7989122 wrote: I might give it a try (maybe 35+ years of coding experience will make it appear simpler), but I haven't got the time right now.
Same here, although coming up for 55 years. One day soon ... 
|
|
|
|
|
Hi All,
I would ask if there any opensource version of telnet client library(encrypted) available for windows
|
|
|
|
|
|
I have a MFC Application, where I am creating a new feature.
The new feature is to write a structure around size 900 KB to a file on disk every second. Similarly, my another application will read the same file every second after some time.
My questions are:
1. How to save the structure (900 KB) to the file in reduced size format, such that the file size doesn't become too big?
2. Saving the structure every second data as an individual file for reading and writing (there will be 60 files for 60 seconds)
or saving the structure sequentially in the same file(only one file)...Which is efficient for reading and writing
Please note that I am going to write the structure to the file for 4 days as a maximum period.
|
|
|
|
|
Quote: 1. How to save the structure (900 KB) to the file in reduced size format, such that the file size doesn't become too big?
It depends on the data. A general compression algorithm is probably not reccomended here, because you have to access fast the struct. So, it is up to you (based on data knowledge) to implement (if feasible) an ad hoc compression/decompression algorithm.
Quote: Saving the structure every second data as an individual file for reading and writing (there will be 60 files for 60 seconds)
or saving the structure sequentially in the same file(only one file)...Which is efficient for reading and writing
At first glance the individual file option looks more promising. But, again, data knowledge could change such an estimate.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
