Posted
by Madhan
on Stack Overflow
See other posts from Stack Overflow
or by Madhan
Published on 2009-11-22T18:08:23Z
Indexed on
2010/04/12
5:53 UTC
Read the original article
Hit count: 422
Can any body tell how to write a multiplication function (in C) using recursion?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
Can someone give me the difference between these two kinds recursions and example?
specifically in ocaml. Thanks
>>> More
as seen on Programmers
- Search for 'Programmers'
I am about to make two assumptions. Please correct me if they're wrong:
There isn't a recursive algorithm without an iterative equivalent.
Iteration is always cheaper performance-wise than recursion (at
least in general purpose languages such as Java, C++, Python etc.).
If it's true that recursion…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I solved Problem 10 of Project Euler with the following code, which works through brute force:
def isPrime(n):
for x in range(2, int(n**0.5)+1):
if n % x == 0:
return False
return True
def primeList(n):
primes = []
for i in range(2,n):
if isPrime(i):
…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have this massive array of ints from 0-4 in this triangle. I am trying to learn dynamic programming with Ruby and would like some assistance in calculating the number of paths in the triangle that meet three criterion:
You must start at one of the zero points in the row with 70 elements.
Your…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
code 1:
public static int fibonacci (int n){
if (n == 0 || n == 1) {
return 1;
} else {
return fibonacci (n-1) + fibonacci (n-2);
}
}
how can you use fibonacci if you haven't gotten done explaining what it is yet? I've been able to understand…
>>> More
