campus placement CoCubes Mock Test Algorithms Searching, Sorting and Hashing Sorting

The worst case time complexity of Quick sort when median is selected as pivot element?(Assume array elements are distinct).

1
O(n2)
2
O(nlogn)
3
O(n)
4
None
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters