engineering recuitment NIELIT Scientific Assistant Mock Test 2025 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
T(n) = 4T(n/2) + O(n)