Timeline for Print the prime factorization of the greatest common divisor of two numbers

11 events

when toggle format	what		by	license	comment
May 12, 2014 at 14:29	comment	added	Keen		Certainly. In practice I'd only use a recursive function if I really needed some kind of stack, like for tree navigation or other inherently recursive data-structures. (Sure, numbers can be treated as recursive data-structures, but we have all kinds of nice abstractions to help us ignore that fact.)
May 9, 2014 at 21:00	comment	added	kernigh		This recursive function failed on `f(301343045, 421880263);` probably because my browser will not let me recurse that deep. Stupid broken Firefox!
May 9, 2014 at 19:16	history	edited	Keen	CC BY-SA 3.0	Updated code, but score stayed the same.
May 9, 2014 at 17:34	history	edited	Keen	CC BY-SA 3.0	Added comments to ungolfed code.
May 9, 2014 at 17:21	history	edited	Keen	CC BY-SA 3.0	added 642 characters in body
May 6, 2014 at 21:27	history	edited	Keen	CC BY-SA 3.0	Add comments to ungolfed code; clarify language version; amazing idea to shorten the arbitrary function name
May 6, 2014 at 21:22	history	edited	Keen	CC BY-SA 3.0	Add comments to ungolfed code.
May 6, 2014 at 20:56	history	edited	Keen	CC BY-SA 3.0	removed duplicate code
May 6, 2014 at 20:55	review	First posts
May 6, 2014 at 20:59
May 6, 2014 at 20:46	history	edited	Keen	CC BY-SA 3.0	`c` variable was unnecessary
May 6, 2014 at 20:39	history	answered	Keen	CC BY-SA 3.0