Hofstadter’s Q-Sequence in Code Coach

Question

Only the first two checks Hofstadter’s Q-Sequence are passing with my code.
Did anyone pass the full exercise with C# or att all?

Answer 1

Are you using recursion?
If yes, try to use for loop.

Answer 2

I did it in C by storing the former results in an array instead of recreating them over and over recursively.

Answer 3

Yes, I use the Recursive Algorithm. The results are correct, but from n=43 on the calculation time is obviously exceeded. So I will therefore use a different method.

Thanks for your tips.

Answer 4

Guys, I made it. I taken a list and calculated the Q(n) in a "for" loop - as Denise Roßberg and HonFu mentioned, step by step for one "n", using the two results Q(n-1) and Q(n-2), that were in the list before. This algorithm is super fast. Now it calculates here for millions. For example Q(50,000,000) = 25,371,105. And that was not even the biggest (n) here. Thanks.

Answer 5

https://www.sololearn.com/Discuss/2113151/?ref=app

Answer 6

Cómo ASER que tú página salga ala red

Answer 7

Y