Code Bubble Sort

 Code Bubble Sort

Send Feedback

Provided with a random integer array/list(ARR) of size N, you have been required to sort this array using 'Bubble Sort'.

Note:

Change in the input array/list itself. You don't need to return or print the elements.

Input format :

The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.

First line of each test case or query contains an integer 'N' representing the size of the array/list.

Second line contains 'N' single space separated integers representing the elements in the array/list.

Output format :

For each test case, print the elements of the array/list in sorted order separated by a single space.

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

Constraints :

1 <= t <= 10^2
0 <= N <= 10^3
Time Limit: 1 sec

Sample Input 1:

1
7
2 13 4 1 3 6 28

Sample Output 1:

1 2 3 4 6 13 28

Sample Input 2:

2
5
9 3 6 2 0
4
4 3 2 1

Sample Output 2:

0 2 3 6 9
1 2 3 4

void reverse(int *input,int start,int high){
    while(start<high){
        swap(input[start],input[high]);
        start++;
        high--;
    }
}
void rotate(int *input, int d, int n)
{
    //Write your code here
    
//   int  array[d]={};
//     for(int i=0;i<d;i++){
//         array[i] = input[i];
//     }
    
//     for(int i=0;(i+d)<n;i++){
        
//             input[i]=input[i+d];
        
//     }
    
//     for(int i=0;i<d;i++){
//         input[n-d+i] = array[i];
//     }
    if(d>=n&&n!=0){
        d=d%n;
    }
    else if(n==0){
        return ;
    }
    reverse(input,0,n-1);
    reverse(input,0,n-d-1);
    reverse(input,n-d,n-1);
}

#include <iostream>
using namespace std;



void reverse(int *input,int start,int high){
    while(start<high){
        swap(input[start],input[high]);
        start++;
        high--;
    }
}
void rotate(int *input, int d, int n)
{
    //Write your code here
    
//   int  array[d]={};
//     for(int i=0;i<d;i++){
//         array[i] = input[i];
//     }
    
//     for(int i=0;(i+d)<n;i++){
        
//             input[i]=input[i+d];
        
//     }
    
//     for(int i=0;i<d;i++){
//         input[n-d+i] = array[i];
//     }
    if(d>=n&&n!=0){
        d=d%n;
    }
    else if(n==0){
        return ;
    }
    reverse(input,0,n-1);
    reverse(input,0,n-d-1);
    reverse(input,n-d,n-1);
}




int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int size;
        cin >> size;
        int *input = new int[size];
        for (int i = 0; i < size; ++i)
        {
            cin >> input[i];
        }
        bubbleSort(input, size);
        for (int i = 0; i < size; ++i)
        {
            cout << input[i] << " ";
        }
        delete[] input;
        cout << endl;
    }
}