GFG_BubbleSort.cpp

/*
https://practice.geeksforgeeks.org/problems/bubble-sort/1#
Bubble Sort

*/

// { Driver Code Starts
//Initial Template for C++

// C program for implementation of Bubble sort
#include <stdio.h>

// swapping the elements
void swap(int *xp, int *yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}


 // } Driver Code Ends
//User function Template for C++

class Solution
{
    public:
    //Function to sort the array using bubble sort algorithm.
    void bubbleSort(int arr[], int n)
    {
        // Your code here  
        for(int k=0; k<n;k++)
        {
            bool flag = true;
            for(int i=0; i<n-k-1; i++)
            {
                
                if(arr[i]>arr[i+1])
                {
                    flag = false;
                   int temp = arr[i];
                   arr[i]=arr[i+1];
                   arr[i+1]=temp;
                }
            }
            if(flag) break;
        }
    }//end
};


// { Driver Code Starts.

/* Function to print an array */
void printArray(int arr[], int size)
{
    int i;
    for (i=0; i < size; i++)
        printf("%d ", arr[i]);
    printf("\n");
}
 
// Driver program to test above functions
int main()
{
    int arr[1000],n,T,i;
  
    scanf("%d",&T);
    
    while(T--){
        
    scanf("%d",&n);
    
    for(i=0;i<n;i++)
      scanf("%d",&arr[i]);
      
    Solution ob;  
      
    ob.bubbleSort(arr, n);
    printArray(arr, n);
    }
    return 0;;
}  // } Driver Code Ends