Register

ME-FST6:Recursive Function call and Callstack

570 views
1 1 vote

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · full subtractor demo...Next → · ME-FST6:Transaction,...
← Previous in category · MadeEasy Subject Tes...Next in category → · Time Complexity And ...
Position:
Show:

Related questions

5 5 votes
1 answers 1 answer
1.6k
1.6k views
srestha asked Aug 6, 2018
1,580 views
Recursive call of a function
How will this function run for the input 123 (where str points '123' and n=3)?in myAtoiRec(int *str,int n) { if(n==1) return*str-'0'; return(10*myAtoiRec(str,n-1)+str[n-1...
2 2 votes
4 4 answers
6.9k
6.9k views
KISHALAY DAS asked Dec 21, 2016
6,905 views
ME-FST6:Transaction,Recoverability and 2PL
4 4 votes
3 answers 3 answers
2.1k
2.1k views
Diksha Aswal asked Jun 27, 2017
2,069 views
Recursive function
int fun(int n) { int s=0,i; if(n<=1) return 1; for(i=1; i*i<n; i++) s+=n; return fun(n/4)+fun(n/4)+s; } what will be the time complexity, returning value and no. of recur...
1 1 vote
1 answers 1 answer
2.5k
2.5k views
radha gogia asked Jul 21, 2015
2,542 views
How many recursive calls are made by gcd function ?
I have already gone through the links of stackoverflow on this topic but still couldn't understand it clearly , so please explain the logic behind this .