Anonymous user
Talk:Stern-Brocot sequence: Difference between revisions
→Algorithm used in the C example is different
Line 7:
==Algorithm used in the C example is different==
The task states a method of calculation that is not used in the current C example. I suggest another example closer to the given algorithm from the task description be used then this C example can be given as an alternative if the algorithm is explained. (I am thinking of starting another task that uses the tree construction and a comparison between the two, but time has not allowed ...). --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 21:47, 8 December 2014 (UTC)
: There's no real difference here: if you look at the n-th element, you obtain the 2n-1 and 2n-th elements, so you can always find each value backwards. The C program doesn't have a problem printing the first members in sequence, so what's wrong with that? --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 22:22, 8 December 2014 (UTC)
| |||