GATE DA 2024 — Question 30

Programming, Data Structures and Algorithmsdivide and conquer: mergesort, quicksortNAT1 markMedium

Consider sorting the following array of integers in ascending order using an in-place Quicksort algorithm that uses the last element as the pivot. 60 70 80 90 100 The minimum number of swaps performed during this Quicksort is ______.
Practise the full 2024 paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on divide and conquer: mergesort, quicksortTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group