Recursion

Question 1

Define

Divide-and-Conquer Algorithms

Answer 1

Commonly used with recursion. Big problem is divided into two smaller problems, solve each one separately by dividing again. Continue until get to base case.

Question 2

Define

Merge Sort

Answer 2

Merges two already sorted arrays. O(NlogN), more efficient than simple sorting methods. But requires additional memory space equal to array sorting.