Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

call-stack

GATE CSE & IT · Complexity Theory · 2005-2005

1
PYQs
100%
keyed
1
elite explanations
1
years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2005 PYQ

Consider the following C - function: double foo(int n){ int i; double sum; if(n == 0) return 1.0; sum = 0.0; for (i = 0; i < n; i++){ sum += foo(i); } return sum; } The space compl...

mediumanswer keyelite explanation