Question 15

DAMCQ1 markNeeds review
Consider that the quick sort algorithm is used to sort an array of

distinct randomly ordered elements. In every call, the pivot is chosen as the first element of the current subarray.
Let

denote the expected time to sort the array. Assume that the time to partition is linear in the size of the current subarray.
Which of the following recurrence relations correctly represents

in this scenario?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

EXPLORE & PRACTISE

Paper and topic context

See where this question comes from and choose what to practise next.

2026DA

GATE DA 2026 · Paper 1

Data Science and Artificial Intelligence · Original paper archive

Section
Data Science and Artificial Intelligence
Question type
Multiple choice (MCQ)
Marks
1 mark

Practise related topics

Explore more previous year questions using this question’s imported topic tags.

data science

GATE DA previous year questions

artificial intelligence

GATE DA previous year questions

computing

GATE DA previous year questions

Programming, Data Structures and Algorithms

GATE DA previous year questions

Comments

Ask a question, share your approach, or help someone understand.

Log in to view the discussion

You’re not logged in. Log in or create an account to see discussions and add comments.