CPP

bubble sort c++

void bubbleSort(int arr[], int n) {
    for (int i=1; i<n; i++) {
        for (int j=i; j<n; j++) {
            if (arr[j] < arr[j-1]) {
                int temp = arr[j];
                arr[j] = arr[j-1];
                arr[j-1] = temp;
            }
        }
    }
}

bubble sort algorithm c++ step by step

#include<iostream>
using namespace std;
int main()
{
    int i, arr[10], j, temp;
    cout<<"Enter 10 Elements: ";
    for(i=0; i<10; i++)
        cin>>arr[i];
    cout<<endl;
    for(i=0; i<9; i++)
    {
        for(j=0; j<(10-i-1); j++)
        {
            if(arr[j]>arr[j+1])
            {
                temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
        cout<<"Step "<<i+1<<": ";
        for(j=0; j<10; j++)
            cout<<arr[j]<<" ";
        cout<<endl;
    }
    cout<<endl;
    return 0;
}

cpp bubble sort

//HOW ABOUT MORE EFFICIENT SOLUTION
//  BASIC IDEA- REPEATEDLY SWAP TWO ADJACENT ELEMENTS IF THEY ARE IN A WRONG ORDER.
#include<bits/stdc++.h>
using namespace std;
void bubblesort(int a[], int n)
{
	bool swapped=false;
	for(int i=0;i<n-1;i++)
	{
		for(int j=0;j<n-i-1;j++)
		{
			if(a[j]>a[j+1]) // check if ADJACENT elements are in a wrong order.
			{
				swap(a[j],a[j+1]); //if they are swap them.
				swapped=true;
			}
		}
		if(swapped==false) break; // if for any particular iteration our array doesn't swap--
        // -- any numbers then we may conclude that our array has already been sorted. :)
	}
}
int main()
{
	int n;
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++) cin>>a[i];
	bubblesort(a,n);
	for(int i=0;i<n;i++) cout<<a[i]<<" ";
	return 0;
}
	

bubble sort in c+

#include <iostream>
#include <iomanip>

using namespace std;

void sort (int array[],int size){
    for(int i=0; i<size-1; i++){           
      for(int j=i+1; j<size; j++){      
        if(array[i] > array[j]){      
            int temp = array[j];
            array[j] = array[i];
            array[i] = temp;
        }
      }
    }
    cout<<"Sorted Array: 
";
    for(int i=0;i<5;i++){
        cout<<setw(5)<<array[i];
    }
}

int main()
{
    int array [5];
    for(int i=0;i<5;i++){
        cout<<"Element "<<i<<": ";
        cin>>array[i];
    }
    sort(array,5);
  
}

c++ code for bubble sort

#include<bits/stdc++.h>

using namespace std;
int main()
{
    //bubble sort;
    int a[5]= {81,56,2,12,9};
    bool flag = false;
    int i,j;
    //if(n>1)
    while(!flag)
    {
        flag = true;
        i=0;
        j=1;
        
        while(j<5)
        {
            if(a[i]>a[j])
            {
                swap(a[i],a[j]);
                 flag = false;
            }
            i++;
            j++;
           
        }
    }
    for(i=0;i<5;i++)
    {
        cout<<a[i];
    }

    return 0;
}

bubble sort c++

#include <bits/stdc++.h>
using namespace std;
int main (void) {
    int a[] = {5, 4, 3, 2, 1}, tempArr, i, j;
    for (i = 0; i < 5; i++) {
        for (j = i + 1; j < 5; j++) {
            if (a[j] < a[i]) {
                tempArr = a[i];
                a[i] = a[j];
                a[j] = tempArr;
            }
        }
    }
    for(i = 0; i < 5; i++) {
        cout<<a[i]<<"
";  
    }  
    return 0; 
}

bubble sort algorithm in c++

// Bubble Sort algorithm -> jump to line 21

...

#include <iostream>      // Necessary for input output functionality
#include <bits/stdc++.h> // To simplify swapping process

...

...

/**
* Sort array of integers with Bubble Sort Algorithm
*
* @param arr   Array, which we should sort using this function
* @param arrSZ The size of the array
* @param order In which order array should be sort
*
* @return Sorted array of integers
*/
void bubbleSortInt(double arr[], int arrSz, string order = "ascending")
{
    for (int i = 0; i < arrSz; ++i)
    {
        for (int j = 0; j < (arrSz - i - 1); ++j)
        {
            // Swapping process
            if ((order == "descending") ? arr[j] < arr[j + 1] : arr[j] > arr[j + 1])
            {
                swap(arr[j], arr[j + 1]);
            }
        }
    }
    return; // Optional because it's a void function
} // end bubbleSortInt

...

int main()
{

...

    return 0; // The program executed successfully.

} // end main

bubble sort function in c++

void bubbleSort(int arr[], int n)
    {
        for(int i=0;i<n;i++)
        {
            for(int j=i+1;j<n;j++)
            {
                if(arr[i]>arr[j])
                {
                    int temp=arr[i];
                    arr[i]=arr[j];
                    arr[j]=temp;
                }
            }
        }
    }