Algorithms Searching, Sorting and Hashing Sorting

Which of the following is correct recurrence for worst case of QuickSort?

1
T(n) = T(n - 4) + T(n - 2) + O(1)
2
T(n) = T(n - 1) + T(0) + O(n)
3
T(n) = 2T(n/2) + O(n)
4
More than one of the above
5
None of the above

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