Translating recursion to divide and conquer

Question

I\'m trying to return the three smallest items in a list. Below is an O(n) solution I\'ve written:

def three_smallest(L):
    # base case
    if (len(L) == 3)