GATE | DA | 2024 | Algorithm | Question 30

Last Updated :
Discuss
Comments

Consider sorting the following array of integers in ascending order using an in-place Quicksort algorithm that uses the last element as the pivot.

60708090100

The minimum number of swaps perfoemed during this quicksort ?

0

1

2

4

This question is part of this quiz :

GATE DA 2024,GATE DA Programming, Data structure and Algorithms Quiz
Tags:
GATE
Algorithms
Share your thoughts in the comments