Let $P$ be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by $P$ for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Select an option to check

Key concept

Searching, Sorting and Hashing

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Searching, Sorting and Hashing

Across GATE CS exams, Searching, Sorting, and Hashing are tested with a strong emphasis on exact comparison/swap counts, worst/best-case edge cases (especially for Quicksort and simultaneous min-max finding), trace-based simulation (such as step-by-step hashing probes and merge passes), and asymptotic tradeoffs for specialized or composite data inputs. Questions range from conceptual 1-mark classification to rigorous 2-mark NATs requiring precise manual execution of collision resolution or optimal merge trees.

Full Searching, Sorting and Hashing guide →

More on Searching, Sorting and Hashing

All 27 questions on Searching, Sorting and Hashing →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Algorithms · Searching, Sorting and Hashing

Official IIT answer key · IIT Kharagpur · Audited Aug 2026

Take topic test

GATE CSE 2014 Set 1 Q14 · MCQ · 1 mark

Let $P$ be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by $P$ for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Select an option to check

Key concept

Searching, Sorting and Hashing

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Searching, Sorting and Hashing

Full Searching, Sorting and Hashing guide →

More on Searching, Sorting and Hashing

All 27 questions on Searching, Sorting and Hashing →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Let $P$ be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by $P$ for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2014 Set 1

More on Searching, Sorting and Hashing

Let $P$ be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by $P$ for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2014 Set 1

More on Searching, Sorting and Hashing

Let PPP be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let t1t_1t1​ and t2t_2t2​ be the number of comparisons made by PPP for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2014 Set 1

More on Searching, Sorting and Hashing

Share this solution

Let PPP be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let t1t_1t1​ and t2t_2t2​ be the number of comparisons made by PPP for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2014 Set 1

More on Searching, Sorting and Hashing

Share this solution

Let $P$ be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by $P$ for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Let $P$ be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by $P$ for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?