What are you working on, Jow Forums?
Last thread:
/dpt/ - Daily Programming Thread
Brody Thomas
Other urls found in this thread:
twitter.com
ivm.sourceforge.net
app.klipse.tech
stackoverflow.com
twitter.com
Charles Cox
go to hell
James Morris
in b4
>OP is not anime
>OP is not amphibian
Here. Happy?
Levi Smith
getting a new pair of programming socks. Recommend me some if you can! teehee :3
Robert Phillips
>haskell from scheme, not ml
what?
i wish i could report this
David Flores
Are you a 10x programmer, user?
Hunter Flores
please don't make me look at brown people
Henry Bailey
Forgive me for asking a simple question, I only just started learning programming two weeks ago.
So in this recursive function, the compiler isn't even compiling the code below the recursive step, i.e. the if (min < A[n - 1]) stuff, until it reaches the base case correct?
int findMaxRec(int A[], int n)
{
int min;
if (n == 1)
{
return A[0];
}
else
{
min = findMaxRec(A, n - 1);//recursive step
if (min < A[n - 1])
{
return min;
}
else
return A[n - 1];
}
}
Benjamin Scott
char* *********x;
Tyler Williams
>that butthurt guy absolutely seething