'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the
technology industry', 'Coding is behind almost everything that is powered
by electricity'

Topics

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

```
Bubble Sort implementation for the given array: {6,2,8,4,10} is shown below :-
```

Detailed explanation

```
1 <= T <= 100
1 <= N <= 100
1 <= Arr[i] <= 1000
Where 'T' represents the number of test cases, 'N' represents the size of the array, and Arr[i] represents the elements of the array.
Time Limit: 1 sec.
```

```
1
5
6 2 8 4 10
```

```
2 4 6 8 10
```

```
2
2
1 2
4
4 3 2 1
```

```
1 2
1 2 3 4
```