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, \dots, 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, \dots, 29]$ as argument, is ________. (Answer in integer)

The given pseudocode implements the standard Bubble Sort algorithm to sort an array in ascending order.

When the input array of $n = 30$ distinct elements is strictly in descending order (reverse sorted), every adjacent comparison A[j] > A[j+1] evaluates to true. Thus, a swap is performed on every iteration of the inner loop.

The total number of swap operations equals the total number of comparisons (or total number of inversions):

For $n = 30$:

Therefore, the number of swap operations performed is 435.