Algorithms · Sorting
Official IIT answer key · IIT Guwahati · Audited Aug 2026
GATE CSE 2025 Set 1 Q33 · NAT · 1 mark
fun() is given below:
fun(int A[0,...,n-1]){
for i=0 to n-2
for j=0 to n-i-2
if (A[j]>A[j+1])
then swap A[j] and A[j+1]
}
Let A[0,…,29] be an array storing 30 distinct integers in descending order. The number of swap operations that will be performed, if the function fun() is called with A[0,…,29] as argument, is ________. (Answer in integer)Key concept
No account needed
Sit 3 related SortingPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
In this topic, GATE tests the performance characteristics and comparison counts of classic sorting algorithms under specific input configurations (such as already sorted arrays). Questions focus on identifying best-case vs. worst-case behaviors, comparison complexity bounds, and algorithm-specific adaptability.
Full Sorting guide →The pseudocode of a function fun() is given below: fun(int A[0,...,n-1]) for i=0 to n-2 for j=0 to n-i-2 if (A[j]>A[j+1]) then swap A[j] and A[j+1] Let A[0, , 29] be an array storing 30 distinct integers in descending order. The number of swap operations that will be performed, if the function fun() is called with A[0, , 29] as argument, is … (Answer in integer)
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.