1. Home
  2. questions

Filters

Found 1 Question

Set Default

List of practice Questions

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, \ldots, 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, \ldots, 29] \) as argument, is __________ (Answer in integer).
  • GATE CS - 2025
  • GATE CS
  • Programming and Data Structures
  • Searching, Sorting and Hashing
contact us
terms & conditions
Privacy & Policy
© 2026 Patronum Web Private Limited