  Rank: Advanced Member Groups: Registered
Joined: 23/07/2013(UTC) Posts: 1,166  Was thanked: 529 time(s) in 355 post(s)
|
Originally Posted by: Jean Giraud  Augmented version & re-tutored. Cheers ... Jean.  This statement is wrong in your document. Iteration is not an attribute of recursion, neither directly or implicitly. It doesn't guess next result recursively, recursion means calling function by itself. Recursion is a function which calls itself. Iteration is simply repetition of a code block. Here is sample for iteration and recursion. Usually recursion takes more time to compute.  fibonacci.sm (8kb) downloaded 42 time(s).
|
 2 users thanked overlord for this useful post.
|
on 03/12/2022(UTC), on 06/12/2022(UTC)
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 23/07/2013(UTC) Posts: 1,166 Was thanked: 529 time(s) in 355 post(s)
|
Fibonacci sequence starts with 0. Your sample is wrong.
0,1,1,2,3,5,8,13,21,34,55
|
|
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 23/07/2013(UTC) Posts: 1,166 Was thanked: 529 time(s) in 355 post(s)
|
|
|
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 23/07/2013(UTC) Posts: 1,166 Was thanked: 529 time(s) in 355 post(s)
|
Fibonacci sequence starts with 0-1, end of debate. I will try to point out and correct a miscalculation if I could. I don't care if it is online calculator, mathcad, matlab, smath, etc. I will always detract when a calculation is wrong and justified. And I will mock and ridicule it if that mistake defended without reason. It is time for you to learn when to stop. Don't post your ridicule ideas and calculations. And don't humiliate yourself anymore.     
|
|
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 23/07/2013(UTC) Posts: 1,166 Was thanked: 529 time(s) in 355 post(s)
|
Originally Posted by: Jean Giraud Good idea you detract yourself from your wrong code.
Fibalgo(26)=121393 You are totally incapable calculating even a very simple thing, AGAIN. My code is correct, yours is wrong. And this didn't surprised me one bit. 
|
|
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 23/07/2013(UTC) Posts: 1,166 Was thanked: 529 time(s) in 355 post(s)
|
You have mistaken index numbers, since smath vector index start with 1.
Near all other calculators starts index with 0.
fib(0) is 0 for them, fib(1) is 0 for smath.
So yeah, fib(26) is 75025 in SMath.
|
|
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 28/08/2014(UTC) Posts: 1,439  Was thanked: 891 time(s) in 566 post(s)
|
Originally Posted by: Jean Giraud What is your concept of "hyperfast" and "command line"? Did you do any kind of testing before making such strong statements? Please do some basic research before posting solutions that are not.  f.sm (5kb) downloaded 27 time(s).Alvaro.
|
2 users thanked Razonar for this useful post.
|
on 06/12/2022(UTC), on 06/12/2022(UTC)
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 28/08/2014(UTC) Posts: 1,439 Was thanked: 891 time(s) in 566 post(s)
|
Originally Posted by: Jean Giraud
1. Command line is pretty universal. Remember Mathsot times.
Sure it is. This is what SMath developers understand about "command line", which matches the universally accepted concept for that expression ( from https://en.smath.com/view/SMathStudio/faq )  So could you show where the "command line" is in your example? Originally Posted by: Jean Giraud
2. Computing 1476 Fibonacci in < 1 s
is hyperfast to me versus Julia set 2 hrs !!!
So, you test your fib against your Julia set ... Do you try to test your fib versus another function that returns Fibonacci numbers? f.sm (9kb) downloaded 24 time(s). Alvaro.
|
|
|
|
|
|
 Rank: Advanced Member Groups: Registered, Advanced Member Joined: 13/01/2012(UTC) Posts: 2,693   Location: Italy Was thanked: 1368 time(s) in 895 post(s)
|
mod: I've merged the threads, if you have different methods you can list or link them in the first post with the edit button. Unless there is a crystal clear difference in methods and a meaningful title, having multiple threads about the same thing makes really hard to navigate and search topics in the forum.I agree you should give proper names to things, recursion and iterations are two very different things and they have an estabilished meaning (like "command line", I'm sure this was already discussed in some other thread previously) To quote myself, this is another simple way to create a Fibonacci sequence in SMath Studio. Originally Posted by: Davide Carpi Edited by user 06 December 2022 16:19:56(UTC)
| Reason: Not specified |
If you like my plugins consider to support SMath Studio buying a plan; to offer me a coffee: paypal.me/dcprojects |
2 users thanked Davide Carpi for this useful post.
|
on 06/12/2022(UTC), on 06/12/2022(UTC)
|
|
|
 Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866  Was thanked: 983 time(s) in 811 post(s)
|
|
|
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 23/03/2016(UTC) Posts: 279  Was thanked: 92 time(s) in 58 post(s)
|
|
|
|
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 983 time(s) in 811 post(s)
|
|
|
|
|
|
|
Forum Jump
You cannot post new topics in this forum.
You cannot reply to topics in this forum.
You cannot delete your posts in this forum.
You cannot edit your posts in this forum.
You cannot create polls in this forum.
You cannot vote in polls in this forum.
