Math, asked by kompalevaishnavi, 5 months ago

Consider the same recursive C function that takes two arguments
unsigned int func(unsigned int n, unsigned int r)
if (n > 0) return (n%r + func (n/r. r));
else return 0;
}
What is the return value of the function foo when it is called as func(513, 2)?

Answers

Answered by nutanparob

Answer:

6656203

Step-by-step explanation:

53249624665620353249624665620353249624665620353249624665620353249624665620353249624665620366562035324962466562035324962453249624665620353249624665620353249624665620353249624665620353249624665620353249624665620353249624665620353249624665620353249624532496246656203532496246656203532496246656203532496246656203665620353249624665620353249624665620353249624665620353249624

code and find

Answered by 2004dharshini

Answer:

255263637353535535336363663

Previous Question

Next Question

Consider the same recursive C function that takes two argumentsunsigned int func(unsigned int n, unsigned int r)if (n > 0) return (n%r + func (n/r. r));else return 0;}What is the return value of the function foo when it is called as func(513, 2)?​

Answers

code and find

Consider the same recursive C function that takes two arguments
unsigned int func(unsigned int n, unsigned int r)
if (n > 0) return (n%r + func (n/r. r));
else return 0;
}
What is the return value of the function foo when it is called as func(513, 2)?