Why can no tweak to a loop drop a complexity class, and how does splitting down to single elements plus a linear merge beat n squared?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
left and right are non-empty sorted lists, like the two sorted halves of a hand of cards. Only their front elements need comparing: remove the smaller front element from its list and return it. pop(0) removes and returns a list's first element. Define take_smaller(left, right).