Divide and Conquor is a [[Recursion|recursive]] [[Algorithm]] technique where a problem is recursively split down until some base case. >[!example] Awful Example >```python >def sum(array: [any]): > if len(array) == 0: > return 0 > > if len(array) == 1: > return array[0] > > if len(array) == 2: > return array[0] + array[1] > > sum1 = sum(array[0:(len(array) / 2)]) > sum2 = sum(array[(len(array) / 2) : (len(array)-1) ]) > > return sum1 + sum2 >```