merge-sort(A)
if size(A) > 1
m <- floor((l + r)/2
Al <- merge-sort(A[l, m])
Ar <- merge-sort(A[m + 1, r])
A <- merge(Al, Ar)
fi
return A
| T(n) | = | Theta(1) | if n < c |
| = | bT(n/b) + D(n) + C(n) | otherwise |
This page last modified on 18 April 2000.