Fibonacci in 41 bytes

README.md

41b Fibonacci

This uses the simple but potentially slow recursive implementation of Fibonacci. Outside a 'short code' contest or a pedagogical setting, nobody in their right minds would code it this way; however it saves:

44b versus first implementation by @mckamey (http://gist.github.com/979716 21b versus "p01's condensation of the same algo (same gist) 21b versus the unnamed version of the same code 11b versus @kassens' very nice variable swapping version (https://gist.github.com/986590)

I'm sure there's probably a couple more bytes to be taken out somewhere!

annotated.js

function f(n){		//Clarification: we ARE allowed named functions
	return n>1?		//Check: are we at a 'generic stage' or 'end stage'?
		f(n-1)+f(n-2)	//Generic: return sum of the two previous terms
		:n		//return 0 for zeroeth term, 1 for 1st term
	}

alert(f(40))

index.js

function f(n){return n>1?f(n-1)+f(n-2):n}

LICENSE.txt

            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
                    Version 2, December 2004

 Copyright (C) 2011 YOUR_NAME_HERE <YOUR_URL_HERE>

 Everyone is permitted to copy and distribute verbatim or modified
 copies of this license document, and changing it is allowed as long
 as the name is changed.

            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION

  0. You just DO WHAT THE FUCK YOU WANT TO.

package.json

{
  "name": "41bFib",

  "description": "calculate fibonacci....reeeeealllly slowly",

  "keywords": [
    "140bytes",
    "Fibonacci",
    "recursive" 
  ]
}

I don't think you need the explicit myFn= part at all (even though you're clearly not counting it towards the 41b)...

Thanks! Sorry, I'm not sure how that slipped in there >_<