You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst-case performance is:
a) O(n log n)
b) O(n²)
c) O(n)
d) O(1)