The argument would be stronger if he wasn't swapping an O(n) algorithm for O(n log(n)). With the recursive implementation you have to touch every element once for each recursion level.
They aren’t discussed in the post, but quadtrees are also very amenable to memoizing common operations.