Which is the best approximation of the summation 1 + 1/2 + 1/3 + ... + 1/n obtained during our analysis of the average case of Quick Sort (and BST)?

A

(log log n)

B

(log n)

C

(n)

D

(n log n)

E

(1/n!)

F

(n!)