@DMX, please clarify your question
you mean given d arrays/lists of variable lengths i.e. n1, n2, ..., nd one
needs to iterate over them
iteratively and recursively ?
On Tue, Feb 2, 2010 at 8:50 AM, Sieu Truc wrote:
> initial assignmnet: g()={n1,..,nd)
> inter(i)
> {
>if(i<0) return;
>
initial assignmnet: g()={n1,..,nd)
inter(i)
{
if(i<0) return;
for(int j=0;j wrote:
> Can you please help me with this one.
>
> write two algorithms that iterate over every index from (0,0,..,0)
> to (n1,n2,..,nd).Make one algorithm recursive and the other
> iterative.
>
> Th
Can you please help me with this one.
write two algorithms that iterate over every index from (0,0,..,0)
to (n1,n2,..,nd).Make one algorithm recursive and the other
iterative.
Thanks
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
T
