Fibonacci numbers with awk

awk 'func f(n){return(n<2?n:f(n-1)+f(n-2))}BEGIN{while(a<24){print f(a++)}}'
recursive version, "pure" AWK
Sample Output
0
1
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657

5
By: unefunge
2010-11-24 10:40:08

4 Alternatives + Submit Alt

What Others Think

Recursion: Pretty much always the wrong way to do something. Unless you're using a compiler on it before you run it, it will almost certainly be massively slower than a loop that does the same thing. Even with a compiler it's not a certainty you'll achieve comparable speeds. This, for instance, is 30x slower than http://www.commandlinefu.com/commands/view/1654/fibonacci-numbers-with-awk
TheMightyBuzzard · 412 weeks ago
who cares? It's elegant. If you really need speed you know where to find a C compiler ;-)
unefunge · 412 weeks ago

What do you think?

Any thoughts on this command? Does it work on your machine? Can you do the same thing with only 14 characters?

You must be signed in to comment.

What's this?

commandlinefu.com is the place to record those command-line gems that you return to again and again. That way others can gain from your CLI wisdom and you from theirs too. All commands can be commented on, discussed and voted up or down.

Share Your Commands



Stay in the loop…

Follow the Tweets.

Every new command is wrapped in a tweet and posted to Twitter. Following the stream is a great way of staying abreast of the latest commands. For the more discerning, there are Twitter accounts for commands that get a minimum of 3 and 10 votes - that way only the great commands get tweeted.

» http://twitter.com/commandlinefu
» http://twitter.com/commandlinefu3
» http://twitter.com/commandlinefu10

Subscribe to the feeds.

Use your favourite RSS aggregator to stay in touch with the latest commands. There are feeds mirroring the 3 Twitter streams as well as for virtually every other subset (users, tags, functions,…):

Subscribe to the feed for: