題組內容

1. Given a vector of n integers, consider the problem of sorting it in increasing order. What is the cost of the insertion sort algorithm in terms of n in the worst case? (5%)

(a) Θ(n)