commandlinefu.com is the place to record those command-line gems that you return to again and again.
Delete that bloated snippets file you've been using and share your personal repository with the world. 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.
If you have a new feature suggestion or find a bug, please get in touch via http://commandlinefu.uservoice.com/
You can sign-in using OpenID credentials, or register a traditional username and password.
First-time OpenID users will be automatically assigned a username which can be changed after signing in.
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
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:
Returns the '$1'th Fibonacci number.
There are 7 alternatives - vote for the best!
If you can do better, submit your command here.
You must be signed in to comment.
recursively finding fibonacci sequences is a really good way to freeze any system up
use a for loop for a more efficient calculation
If one were worried about efficiency, then one should not use a shell script.
This was quick to write. Thanks for the input.
fib(){ k=0; l=1; for i in `seq 1 $1`; do t=$l; l=$(($l + $k)); k=$t; done; echo $k;}also quick to write, but much faster
fpunktk: 93th and some others afterwards are negative, why is that?
I had never really used bash case statements before and was trying them out. If I really wanted to use large numbers, I would have done:
python -c 'def fib(n):if n not in fibs:fibs[n]=fib(n-1)+fib(n-2)
return fibs[n]
import sys;fibs={0:0,1:1};print fib(int(sys.argv[1]))' 7
13