GATE CS 2025 Set 1 — Question 33
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+1 / -0MediumBubble, Insertion, Selection SortSortingAlgorithms
Algorithms → Sorting → Bubble, Insertion, Selection Sort
Last updated
Question
The pseudocode of a function is given below:Let be an array storing distinct integers in descending order. The number of swap operations that will be performed, if the function is called with as argument, is __________. (Answer in integer)
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]
}
Correct answer
435 to 435
Solution
The given pseudocode is an implementation of the Bubble Sort algorithm.
1.The outer loop runs for from to .
2.The inner loop runs for from to .
3.A swap occurs whenever .
4.The input array contains distinct integers in descending order. This means for any , will always be true initially and throughout the process until the array is sorted.
5.In Bubble Sort, if the array is in descending order, every comparison results in a swap.
6.The total number of swaps is the sum of the number of iterations of the inner loop:
7.Substituting :
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Sorting
2026 Set 1 Q17Consider the following recurrence relations: For all ,…2026 Set 2 Q24Consider the following functions, where is a positive integer.…2026 Set 2 Q25Which of the following can be recurrence relation(s) corresponding to an algorithm with time…2026 Set 2 Q32Consider an array . Suppose the merge sort algorithm is…2026 Set 2 Q37Let be a weighted directed acyclic graph with edges and vertices. Given and a…