Here is a Python solution for the problem:

```python
def bubbleSort(arr):
n = len(arr)
swap_count = 0
for i in range(n):
for j in range(0, n-i-1):
if arr[j] arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]
swap_count += 1
return swap_count

T = int(input().strip())
for _ in range(T):
N = int(input().strip())
arr = list(map(int, input().strip().split()))
print(bubbleSort(arr))
```

This program works by defining a function `bubbleSort` that sorts an array using the Bubble Sort algorithm and counts the number of swaps made. The function iterates over each element in the array, and for each element, it iterates over the rest of the array. If it finds an element that is larger than the next one, it swaps them and increments the swap count.

The main part of

Question

Here is a Python solution for the problem:

```python
def bubbleSort(arr):
    n = len(arr)
    swap_count = 0
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1] :
                arr[j], arr[j+1] = arr[j+1], arr[j]
                swap_count += 1
    return swap_count

T = int(input().strip())
for _ in range(T):
    N = int(input().strip())
    arr = list(map(int, input().strip().split()))
    print(bubbleSort(arr))
```

This program works by defining a function `bubbleSort` that sorts an array using the Bubble Sort algorithm and counts the number of swaps made. The function iterates over each element in the array, and for each element, it iterates over the rest of the array. If it finds an element that is larger than the next one, it swaps them and increments the swap count.

The main part of

Knowee AI · Accepted Answer

Here is a Python solution for the problem:

```python
def bubbleSort(arr):
    n = len(arr)
    swap_count = 0
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1] :
                arr[j], arr[j+1] = arr[j+1], arr[j]
                swap_count += 1
    return swap_count

T = int(input().strip())
for _ in range(T):
    N = int(input().strip())
    arr = list(map(int, input().strip().split()))
    print(bubbleSort(arr))
```

This program works by defining a function `bubbleSort` that sorts an array using the Bubble Sort algorithm and counts the number of swaps made. The function iterates over each element in the array, and for each element, it iterates over the rest of the array. If it finds an element that is larger than the next one, it swaps them and increments the swap count.

The main part of

Question

Solution

Similar Questions

Upgrade your grade with Knowee