(a) Fastest can sort (for general sorting) ______ O(2ⁿ)

(b) Fastest can search sorted list ______ O(n³)

(c) Fastest can search unsorted list ______ O(n² logn)

(d) Intractable rate of growth ______ O(n²)

(e) Average rate of growth of BubbleSort ______ O(nlogn)

(f) Constant time regardless of problem size ______ O(n)

O(logn)

O(1)