Recursion Flashcards
1
Q
recursion
A
function makes 1 or more calls to itself during execution
2
Q
activation record
A
stores info about progress of that invocation of function each time function called
3
Q
binary search
A
locates target value w/in sorted sequence of n elements:
O(log n) time
4
Q
sequential search
A
search target by looping thru every element until finding value on unsorted sequence: O(n) time
5
Q
linear recursion/
binary recursion
A
each invocation of body makes at most 1/(2)recursion call(s)(reflects structure of recursion trace)
