GATE 2014 · SET - 1
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
Related Algorithms PYQs
Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order. ```c int Pr…
Suppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up all the num…
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? T(n) = 2T(n / 2) + log n
Suppose you are provided with the following function declaration in the C programming language: ```c int partition(int a[ ], int n…
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n …
Let P be a quick sort program to sort numbers in ascending order using the first element as the pivot. Let t1 and t2 be the number…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.