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

buble sort c++

Add Answer

Lucky Lion answered on April 14, 2022 Popularity 5/10 Helpfulness 2/10

answer buble sort c++

related bubble sort c++

related buble sort c++

related bubble sort c++

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

Closely Related Answers

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

buble sort c++

Contents

More Related Answers

buble sort c++

Closely Related Answers

bubble sort c++

buble sort c++

buble sort c++

bubble sort c++

Grepper

Documentation

Social

Legal

Contact

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