问题：
[单选题]We have obtained the median selection algorithm with the worst time complexity O(n) in this section. If we use it for the pivot selection of quicksort, the resulting worst-case time complexity of quicksort is ______
我们在本节中已经得到了最坏时间复杂度为O(n)的中位数选取算法，若把它用于快速排序的轴点选取，得到的快速排序最坏时间复杂度为______
AO(n)
BO(nlglgn)
CO(nlgn)
DO(n^2)
