Note if n = 1, Then T(n) =

- DIVIDE computes middle of array in constant time: D(n) =
- CONQUER sorts 2 subarrays of size n/2 in time: 2T(n/2)
- COMBINE (Merge) procedure: C(n) =

T(n) =

Note that dominates .

We will show later that T(n) =
, where lg =
.