Re: Steve Summit C Notes {Anticipating the next one}

Old Wolf said:

<snip>

There is a simpler way to compute the sequence of Fibonacci numbers !

usernnnnn's solution looked pretty simple to me. What way did you have
in mind that is simpler? If it involves recursion or iteration, you'll
have your work cut out justifying that "simpler" claim.

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.
.

Relevant Pages

  • Re: Steve Summit C Notes {Anticipating the next one}
    ... in mind that is simpler? ... then recursion or iteration might ... If you just want one value at a specified place in the sequence, ...
    (comp.lang.c)
  • Re: counting BST nodes using iteration
    ... I have written the following function to count the nodes in a BST ... without using recursion. ... It uses iteration. ... Why did you snip my final sentence, ...
    (comp.programming)
  • Re: counting BST nodes using iteration
    ... I have written the following function to count the nodes in a BST ... without using recursion. ... It uses iteration. ... But the text you deleted in an unmarked snip does - sort of. ...
    (comp.programming)
  • Re: counting BST nodes using iteration
    ... snip ... ... I have written the following function to count the nodes in a BST ... without using recursion. ... It uses iteration. ...
    (comp.programming)
  • Re: Why are my posts
    ... for a 10/6d Jetex 50 - less than half the price of a piston motor. ... 10/6d would have been the best part of 3 months' pocket money when I was ... You could go into a sweet shop and get change from 1d, mind you. ...
    (uk.people.support.depression)