@programminginc - страница 2248

Anonymous

k

Serenity

I couldn't find a solution to my recursive problem.

Serenity

Can anyone help me with that ?

Francisco

Can anyone help me with that ?

What have you done? Some code maybe?

Serenity

Yes I have written a code.

Serenity

I'll share it with you, just tell me if I am in the right direction.

Serenity

Taylor Rose

hello everyone ... need help with cryptography,advise the book, namely in the 'encryption hierarchy'?

Francisco

I'm missing information, why don't you send the full funcion?

Serenity

The desired outcome should roughly converge to 1.75..

Serenity

Just a second I'll upload the entire task

Taylor Rose

hello everyone ... need help with cryptography,advise the book, namely in the 'encryption hierarchy'?

but a normal book without "excess water"

Serenity

This is what I am asked to do.

Serenity

And N is an integer provided by the user.

Serenity

so it's a finite sum and there is no need to be concerned about memory stuff and all that...

Francisco

This is what I am asked to do.

Not this. Send all the code you've written

Serenity

Okay.

Serenity

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <math.h> // NOTE: Since <math.h> is included, you can use sqrt() to calculate the square-root of a number. double repetitiveroot(int n) { if (n == 1) return 1; return sqrt(n) + sqrt(repetitiveroot(n-1));// the recursive call } // HERE: DEFINE THE RECURSIVE FUNCTION THAT CALCULATES THE VALUE OF THE EXPRESSION GIVEN IN THE HW int main() { int n; double res; printf("Please enter a number:\n"); scanf("%d", &n); if (n < 0) return 0; res = repetitiveroot(n); // recursive function call printf("Result = %lf", res); return 0; }

Anonymous

just writing this on paper as a mathematical function should tell you that you are wrong. this is why i asked you to read some lecture pdfs on recursion instead of giving you a solution in code.

Serenity

I am new to recursion and this type of questions is quite heavy on me

Serenity

So I need to some sort of boost and practical guidance in order to deal with recursion

Anonymous

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <math.h> // NOTE: Since <math.h> is included, you can use sqrt() to calculate the square-root of a number. double repetitiveroot(int n) { if (n == 1) return 1; return sqrt(n) + sqrt(repetitiveroot(n-1));// the recursive call } // HERE: DEFINE THE RECURSIVE FUNCTION THAT CALCULATES THE VALUE OF THE EXPRESSION GIVEN IN THE HW int main() { int n; double res; printf("Please enter a number:\n"); scanf("%d", &n); if (n < 0) return 0; res = repetitiveroot(n); // recursive function call printf("Result = %lf", res); return 0; }

btw, in printf it should be %f for double. in scanf it's %lf for double. this is because float arguments are promoted to double, so both float and double become double in printf. float * is not promoted to double *, so float and double need different specifiers in scanf.

Anonymous

So I need to some sort of boost and practical guidance in order to deal with recursion

i still suggest you take a look at this https://people.cs.pitt.edu/~milos/courses/cs441/lectures/Class15.pdf

Francisco

I am new to recursion and this type of questions is quite heavy on me

Well, I gave the problem a try, and the best way to do it is to delegate the recursion to a second function that goes from 1 to n

Francisco

That means, the base case is n and not 1