Timeline for Solving Recurrence Equations containing two Recursion Calls

9 events

when toggle format	what		by	license	comment
S Sep 28, 2013 at 12:36	history	suggested	Bernhard Barker		Added applicable tag
Sep 28, 2013 at 11:59	review	Suggested edits
S Sep 28, 2013 at 12:36
May 10, 2012 at 14:04	history	edited	Raphael		edited tags
May 6, 2012 at 10:49	comment	added	Alex ten Brink		If you have a recurrence of that form, there MUST be a base case, say $T(n) \leq 42$ for all $n < 100$. If not, then there's no saying what the recurrence will solve to: maybe $T(n) = 2^m$ for all $n < 100$, where $m$ is the size of the original problem! (imagine a recursion that ends in comparing the constant number of whatever you're recursing on to all subsets of the original elements) In other words: no base case implies not enough information to solve the recurrence.
May 6, 2012 at 10:18	answer	added	JeffE		timeline score: 16
May 6, 2012 at 5:15	history	tweeted			twitter.com/#!/StackCompSci/status/199004424335663104
May 6, 2012 at 0:15	answer	added	user742		timeline score: 14
May 6, 2012 at 0:13	answer	added	Aryabhata		timeline score: 14
May 5, 2012 at 23:47	history	asked	Laura	CC BY-SA 3.0