Bubble Sort
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.

For Example:

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

Input Format:

The first line of input contains an integer 'T' representing the number of test cases. Then the test case follows. The first line of each test case contains integer N denoting the size of the array. The second line of each test case contains 'N' space-separated integers representing the array elements

Output Format:

The only line of output of each test case should print the sorted array in increasing order. Output for each test case will be printed in a separate line.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function. Also, you need to update the given array in place only.

Constraints:

1

Question

Bubble Sort

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.

For Example:

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

Alt test

Input Format:

The first line of input contains an integer 'T' representing the number of test cases.
Then the test case follows.

The first line of each test case contains integer N denoting the size of the array.

The second line of each test case contains 'N' space-separated integers representing the array elements

Output Format:

The only line of output of each test case should print the sorted array in increasing order.

Output for each test case will be printed in a separate line.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function. Also, you need to update the given array in place only.

Constraints:

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.

Accepted Answer

1. created array
2. sorted using bubble sort
3. optimized

Accepted Answer

Implementation

Bubble sort is a standard sorting algorithm that uses nested loops to check all adjacent elements in an array and swap them if they are not in the right order of sorting.

Steps :

Use a flag variable to keep track, if the array is already sorted or not.
Use a loop to iterate over all the elements of the array.
Use a nested loop to check if the adjacent elements are in the correct order or not.
If no, swap the elements and make the flag variable true.
After the iterations are finished, the array becomes sorted in-place.

Space Complexity: O(1)Explanation:

O(1).

We are using constant extra memory.

Time Complexity: O(1)Explanation:

O(N^2), where N is the length of the input array.

In the worst case, if the array is sorted in the reverse order, then the time complexity will be O(N^2).

Accepted Answer

created array

2. sorted using bubble sort

3. optimized

Accepted Answer

1. created array