Find max in [3,1,4,1,5,9,2,6]: split into halves, find max of each half recursively (9 in right half), then take max of the two halves: 9. The combine step is O(1), so T(n) = 2T(n/2) + O(1) = O(n). Same work as linear scan, but the pattern generalizes.