Breaking News: Grepper is joining You.com. Read the official announcement!

bubble sort c++

Add Answer

28_ Lê Thành Phát answered on December 26, 2021 Popularity 5/10 Helpfulness 1/10

answer bubble sort c++

related cpp bubble sort

related bubble sort in c+

related bubble sort algorithm c++ step by step

related c++ code for bubble sort

related bubble sort c++

related buble sort c++

related bubble sort algorithm in c++

related array bubble sort c++ static

bubble sort c++

Comment

-1

// hàm sắp xếp nổi bọt (bubble sort)
void BubbleSort(int a[], int n){
    int temp; // biến tạm temp
    for (int i = 0; i < n; i++){
	for (int j = i + 1; j < n; j++){
		if (a[j] > a[j+1]){
                    temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
			}
		}
	}
}

Popularity 5/10 Helpfulness 1/10 Language cpp

Source: viblo.asia

Tags: bubble-sort c++

Link to this answer
Share Copy Link

Contributed on Feb 26 2024

28_ Lê Thành Phát

0 Answers Avg Quality 2/10

Closely Related Answers

cpp bubble sort

Comment

//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;
}

Popularity 10/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Jul 29 2022

ROCKETMAN

0 Answers Avg Quality 2/10

bubble sort in c+

Comment

#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: \n";
    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);
  
}

Popularity 10/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Apr 16 2022

S.Y

0 Answers Avg Quality 2/10

bubble sort algorithm c++ step by step

Comment

#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;
}

Popularity 9/10 Helpfulness 5/10 Language cpp

Source: codescracker.com

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Oct 16 2022

Dee Nazareth

0 Answers Avg Quality 2/10

c++ code for bubble sort

Comment

#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;
}

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Dec 26 2021

Eager Eagle

0 Answers Avg Quality 2/10

bubble sort c++

Comment

#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]<<"\n";  
    }  
    return 0; 
}

Popularity 9/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Apr 14 2022

krishnaa s

0 Answers Avg Quality 2/10

buble sort c++

Comment

// Optimized implementation of Bubble sort
#include <stdbool.h>
#include <stdio.h>
  
void swap(int* xp, int* yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}
  
// An optimized version of Bubble Sort
void bubbleSort(int arr[], int n)
{
    int i, j;
    bool swapped;
    for (i = 0; i < n - 1; i++) {
        swapped = false;
        for (j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                swap(&arr[j], &arr[j + 1]);
                swapped = true;
            }
        }
  
        // If no two elements were swapped by inner loop,
        // then break
        if (swapped == false)
            break;
    }
}
  
// Function to print an array
void printArray(int arr[], int size)
{
    int i;
    for (i = 0; i < size; i++)
        printf("%d ", arr[i]);
}
  
// Driver program to test above functions
int main()
{
    int arr[] = { 64, 34, 25, 12, 22, 11, 90 };
    int n = sizeof(arr) / sizeof(arr[0]);
    bubbleSort(arr, n);
    printf("Sorted array: \n");
    printArray(arr, n);
    return 0;
}

Popularity 5/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 06 2023

Lucky Lion

0 Answers Avg Quality 2/10

buble sort c++

Comment

// Optimized implementation of Bubble sort
#include <bits/stdc++.h>
using namespace std;
  
// An optimized version of Bubble Sort
void bubbleSort(int arr[], int n)
{
    int i, j;
    bool swapped;
    for (i = 0; i < n - 1; i++) {
        swapped = false;
        for (j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                swap(arr[j], arr[j + 1]);
                swapped = true;
            }
        }
  
        // If no two elements were swapped
        // by inner loop, then break
        if (swapped == false)
            break;
    }
}
  
// Function to print an array
void printArray(int arr[], int size)
{
    int i;
    for (i = 0; i < size; i++)
        cout << " " << arr[i];
}
  
// Driver program to test above functions
int main()
{
    int arr[] = { 64, 34, 25, 12, 22, 11, 90 };
    int N = sizeof(arr) / sizeof(arr[0]);
    bubbleSort(arr, N);
    cout << "Sorted array: \n";
    printArray(arr, N);
    return 0;
}
// This code is contributed by shivanisinghss2110

Popularity 6/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 06 2023

Lucky Lion

0 Answers Avg Quality 2/10

buble sort c++

Comment

// C++ program for implementation
// of Bubble sort
#include <bits/stdc++.h>
using namespace std;

// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
	int i, j;
	for (i = 0; i < n - 1; i++)

		// Last i elements are already
		// in place
		for (j = 0; j < n - i - 1; j++)
			if (arr[j] > arr[j + 1])
				swap(arr[j], arr[j + 1]);
}

// Function to print an array
void printArray(int arr[], int size)
{
	int i;
	for (i = 0; i < size; i++)
		cout << arr[i] << " ";
	cout << endl;
}

// Driver code
int main()
{
	int arr[] = { 5, 1, 4, 2, 8};
	int N = sizeof(arr) / sizeof(arr[0]);
	bubbleSort(arr, N);
	cout << "Sorted array: \n";
	printArray(arr, N);
	return 0;
}
// This code is contributed by rathbhupendra

Popularity 6/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Aug 21 2022

Vishvajeet Singh Nayal 21BCE3732

0 Answers Avg Quality 2/10

bubble sort algorithm in c++

Comment

// 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

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: github.com

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Aug 26 2022

mrasadatik

0 Answers Avg Quality 2/10

array bubble sort c++ static

Comment

#include <iostream>
using namespace std;
int main()
{
    cout << "Hello world!" << endl;

    cout << "Enter N : ";
    int n ;
    cin >> n ;
    int m[n];
    int temp = 0 ;
     for(int i = 0 ; i < n ; i++)
      {
          cout << "Enter m [ " << i << "] = ";
          cin >> m[i];
      }
    for(register int i = 0 ; i < n; i++ )
        for(register int j = 0 ; j < n-1 ; j++)
            if( m[j] > m[j+1] )
                {
                    temp = m[j];
                    m[j] = m[j+1];
                    m[j+1] = temp;
                }
    for(int k = 0 ; k < n ; k++)
        cout  << m[k] << "\t";
    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: bubble-sort c++ static

Link to this answer
Share Copy Link

Contributed on Jun 19 2022

Foad Shahrokh

0 Answers Avg Quality 2/10

bubble sort c++

Contents

More Related Answers

bubble sort c++

Closely Related Answers

cpp bubble sort

bubble sort in c+

bubble sort algorithm c++ step by step

c++ code for bubble sort

bubble sort c++

buble sort c++

buble sort c++

buble sort c++

bubble sort algorithm in c++

array bubble sort c++ static

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.