previous
|
index
|
next
Tree Recursion
Another approach
Divide the work into 2 (or more) similar subproblems and combine their results into an overall solution.
"Divide and Conquer" strategy
Used by merge sort:
previous
|
index
|
next