If a recursive algorithm calls itself twice for each element in a set, does that mean it has n^2 complexity, or is that 2n and therefore n complexity? I am confused.
Name:
Anonymous2012-11-12 16:11
>>1
that would depend on the algorithm (you haven't stated even the base condition