Timeline for Recursion without factorial, Fibonacci numbers etc
Current License: CC BY-SA 3.0
40 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2015 at 1:04 | review | Close votes | |||
| Jul 13, 2015 at 3:08 | |||||
| Apr 19, 2015 at 21:04 | review | Close votes | |||
| Apr 21, 2015 at 13:54 | |||||
| Apr 18, 2015 at 17:08 | comment | added | KChaloux |
@ZacharyK You mean the naive implemention, fib n = fib (n - 1) + fib (n - 2)? Because that's not tail-call optimizable. It will still perform terribly in a language like Haskell.
|
|
| Apr 18, 2015 at 16:11 | history | protected | gnat | ||
| Apr 18, 2015 at 11:17 | history | edited | Ixrec |
STCI - Education tags (see http://meta.programmers.stackexchange.com/a/7288/161917)
|
|
| Dec 3, 2013 at 11:29 | review | Close votes | |||
| Dec 5, 2013 at 11:40 | |||||
| S Jul 20, 2013 at 21:06 | history | suggested | lazyCrab | CC BY-SA 3.0 |
Improved formatting and grammar.
|
| Jul 20, 2013 at 18:41 | review | Suggested edits | |||
| S Jul 20, 2013 at 21:06 | |||||
| Apr 5, 2012 at 12:29 | comment | added | Zachary K | @dan04 unless your language is smart enough to implement tail call optimization like most functional languages in which case it works just fine | |
| Sep 14, 2011 at 12:47 | comment | added | R.. GitHub STOP HELPING ICE | @dan04: Recursion is a horrible way to implement almost anything due to the possibility of stack overflow in most lanaguages. | |
| Sep 14, 2011 at 12:07 | comment | added | Joren | blogs.msdn.com/b/ericlippert/archive/2004/05/19/… | |
| Sep 14, 2011 at 10:13 | answer | added | sharptooth | timeline score: -1 | |
| Sep 14, 2011 at 3:39 | comment | added | Andrew Grimm | @dan04: Obviously you use memoization! My problem is that almost every example of memoization uses Fibonacci numbers! | |
| Sep 14, 2011 at 2:01 | comment | added | user unknown |
case _ => fib (max, count + 1, a+b, a)} (continued, line break significant.)
|
|
| Sep 14, 2011 at 2:00 | comment | added | user unknown |
@dan04: Needn't be, see this scala-code: def fib (max: Int, count: Int=1, a: Int=1, b: Int=0) : Int = (max > count) match { case false => a
|
|
| Sep 13, 2011 at 20:59 | history | edited | houbysoft | CC BY-SA 3.0 |
edited body
|
| Sep 13, 2011 at 20:21 | answer | added | Gabriel | timeline score: 6 | |
| S Sep 13, 2011 at 20:07 | answer | added | Bill K | timeline score: -2 | |
| S Sep 13, 2011 at 20:07 | history | made wiki | Post Made Community Wiki by Bill K | ||
| Sep 13, 2011 at 19:16 | answer | added | Caleb | timeline score: -1 | |
| Sep 13, 2011 at 19:00 | answer | added | deepee1 | timeline score: 3 | |
| Sep 13, 2011 at 18:05 | comment | added | dan04 | @Zach: Even so, recursion is a horrible way to implement Fibonacci numbers, because of the exponential running time. | |
| Sep 13, 2011 at 16:22 | answer | added | GregW | timeline score: -2 | |
| Sep 13, 2011 at 16:18 | answer | added | David Stone | timeline score: 3 | |
| Sep 13, 2011 at 15:23 | comment | added | Dan Ray | The proudest I ever was of a function was when I wrote a thing to navigate a set of product categories/subcategories. The function took its current position in that hierarchy, showed all top level items, and expanded the drill-down to show the current category, and the subcategories within that category. So, (Shoes) (Pants) (Shirts > Dress > Long Sleeve) (Socks) (Hats), with category nesting of arbitrary depth. | |
| Sep 13, 2011 at 15:15 | answer | added | Stephen Swensen | timeline score: 4 | |
| Sep 13, 2011 at 13:49 | comment | added | Eric Wilson | The Little Schemer is a whole book on recursion that never uses Fact or Fib. junix-linux-config.googlecode.com/files/… | |
| Sep 13, 2011 at 13:48 | comment | added | Zach L | While your question is completely valid, I'd hesitate calling Fibonacci numbers useless in real life. Same goes for factorial. | |
| Sep 13, 2011 at 13:26 | answer | added | S.Lott | timeline score: 8 | |
| Sep 13, 2011 at 12:52 | history | tweeted | twitter.com/#!/StackProgrammer/status/113595931437449216 | ||
| Sep 13, 2011 at 11:18 | answer | added | SF. | timeline score: 41 | |
| Sep 13, 2011 at 11:17 | vote | accept | synapse | ||
| Sep 13, 2011 at 11:12 | answer | added | Daniel Scocco | timeline score: 23 | |
| Sep 13, 2011 at 11:02 | answer | added | Sardathrion - against SE abuse | timeline score: 5 | |
| Sep 13, 2011 at 11:00 | answer | added | tdammers | timeline score: 50 | |
| Sep 13, 2011 at 11:00 | answer | added | pdr | timeline score: 105 | |
| Sep 13, 2011 at 10:59 | answer | added | user25446 | timeline score: 5 | |
| Sep 13, 2011 at 10:58 | answer | added | Oded | timeline score: 5 | |
| Sep 13, 2011 at 10:56 | answer | added | Zachary K | timeline score: 11 | |
| Sep 13, 2011 at 10:51 | history | asked | synapse | CC BY-SA 3.0 |