Bubble Sort Problem Statement

Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.

Input:

The first line contains an integer 'T' representing the number of test cases.
Each test case consists of:
The first line containing an integer N denoting the size of the array.
The second line containing N space-separated integers representing the array elements.

Output:

Each test case output will print the sorted array in increasing order in a separate line.

Example:

Input:

1
5
6 2 8 4 10

Output:

2 4 6 8 10

Constraints:

1

Question

Bubble Sort Problem Statement

Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.

Input:

The first line contains an integer 'T' representing the number of test cases.
Each test case consists of:
The first line containing an integer N denoting the size of the array.
The second line containing N space-separated integers representing the array elements.

Output:

Each test case output will print the sorted array in increasing order in a separate line.

Example:

Input:

1
5
6 2 8 4 10

Output:

2 4 6 8 10

Constraints:

1 <= T <= 100
1 <= N <= 100
1 <= Arr[i] <= 1000

Note: You do not need to print anything explicitly. Just implement the given function to sort the array in place.

Accepted Answer

Bubble Sort algorithm to sort an array of non-negative integers in non-decreasing order.

Implement Bubble Sort algorithm to sort the array in place
Loop through the array and compare adjacent elements, swapping if necessary
Repeat the process until the array is sorted
Time complexity of O(n^2) in worst case scenario

Bubble Sort Problem Statement

Input:

Output:

Example:

Input:

Output:

Constraints:

Popular interview questions of Intern