the only solution that i have in mind in calling this function from inside a for loop
from another function
but unfortunately i am not allwed to use loops ,external function
its all has to be done in this function in a recursive way
??
(i can add parameters to the signature)
Well, the function just has to be recursive in several ways. It has to recurse through the array to start at different starting points; it has to recurse over an element, skipping over it; and it has to recurse, counting an element (if it is greater than the previous element). At least my implementation that I whipped up did.
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
i dont know how to do this multy tasking recursion
how am i supposed to do that?
how am i supposed to store the result of one task
while doing another one??
I believe this would be a great way to get started on it http://cboard.cprogramming.com/showp...21&postcount=7
i've done plenty of thatOriginally Posted by itCbitC
did you try googling the thread title?.
Not everything that can be counted counts, and not everything that counts can be counted
- Albert Einstein.
No programming language is perfect. There is not even a single best language; there are only languages well suited or perhaps poorly suited for particular purposes.
- Herbert Mayer
no i dont
i am thinking of how to combine then into one recursion
There is an good algorithm to do this.
wikipedia.org/wiki/Longest_increasing_subsequence
Last edited by stevesmithx; 01-14-2009 at 01:49 AM.
Not everything that can be counted counts, and not everything that counts can be counted
- Albert Einstein.
No programming language is perfect. There is not even a single best language; there are only languages well suited or perhaps poorly suited for particular purposes.
- Herbert Mayer
whats the algorithm
??
this algorithm is iterative "for" on external function
i thought of that already
it doesnt help me at all
maybe you should take something like this:
http://www.algorithmist.com/index.ph..._Subsequence.c
and try to convert all the loops into recursion.
i saw this
its too complicated for me
there is no way i could convert it to a recursive form
And how do you propose we solve that problem?
Of course, you can remove ALL of the prev variables, as they are just set, never referenced.
You can also remove best if you only want to find ONE max value.
--
Mats
Compilers can produce warnings - make the compiler programmers happy: Use them!
Please don't PM me for help - and no, I don't do help over instant messengers.
i got this article
but its so abstract
i dont know how to use their words
http://tclab.kaist.ac.kr/~otfried/cs500/09-dp.pdf
