Reputation
3,366
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
2 22 50
Impact
~91k people reached

Feb
20
awarded  Popular Question
Dec
3
awarded  Notable Question
Nov
30
awarded  Notable Question
Nov
19
awarded  Popular Question
Oct
8
awarded  Notable Question
Sep
28
awarded  Notable Question
Sep
20
awarded  Popular Question
Jul
31
awarded  Popular Question
Jul
28
comment Fibonacci Sequence Generator
Recursion, like you used in your first solution, may look like the most natural solution, but in practice its performance is just horrible. This is easy to see, as calculating f[n-1] implies calculating f[n-2], which you do again later on. Computing f[50] takes over 12 billion additions, compared to 50 when calculating iteratively. Fibonacci numbers are probably the best example where a perfect recursive definition is not a good idea to implement.
Jul
22
reviewed Reject Can't load LevelScheme package
Jul
22
comment Mathematica ignores image orientation
Yeah, I haven't been there in years. (Too) busy with other things. However, every now and again I get an electronics question via my site (it's on my profile), and I still try to help people out.
Jul
21
accepted Mathematica ignores image orientation
Jul
21
comment Mathematica ignores image orientation
Thanks, Wizard (again! :-)). Works in version 9 too, but I couldn't find any of this information in the help system.
Jul
21
asked Mathematica ignores image orientation
Jun
11
awarded  Yearling
May
15
awarded  Notable Question
May
1
awarded  Good Answer
Apr
19
comment Artistic image vectorization
@Szabolcs - BTW, the word is search by image. There's a Firefox plug-in which I use almost daily.
Apr
4
accepted How can I tally continuous sequences in a list?
Apr
3
asked How can I tally continuous sequences in a list?