Bubble Sort Algorithm - GeeksforGeeks (2024)

// Optimized implementation of Bubble sort#include <bits/stdc++.h>using namespace std;// An optimized version of Bubble Sortvoid 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 arrayvoid printArray(int arr[], int size){ int i; for (i = 0; i < size; i++) cout << " " << arr[i];}// Driver program to test above functionsint 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

// 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 Sortvoid 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 arrayvoid printArray(int arr[], int size){ int i; for (i = 0; i < size; i++) printf("%d ", arr[i]);}// Driver program to test above functionsint 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;}

// Optimized java implementation of Bubble sortimport java.io.*;class GFG {  // An optimized version of Bubble Sort static void bubbleSort(int arr[], int n) { int i, j, temp; boolean 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] and arr[j+1] temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; swapped = true; } } // If no two elements were // swapped by inner loop, then break if (swapped == false) break; } } // Function to print an array static void printArray(int arr[], int size) { int i; for (i = 0; i < size; i++) System.out.print(arr[i] + " "); System.out.println(); } // Driver program public static void main(String args[]) { int arr[] = { 64, 34, 25, 12, 22, 11, 90 }; int n = arr.length; bubbleSort(arr, n); System.out.println("Sorted array: "); printArray(arr, n); }}// This code is contributed// by Nikita Tiwari.

# Optimized Python program for implementation of Bubble Sortdef bubbleSort(arr): n = len(arr) # Traverse through all array elements for i in range(n): swapped = False # Last i elements are already in place for j in range(0, n-i-1): # Traverse the array from 0 to n-i-1 # Swap if the element found is greater # than the next element if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] swapped = True if (swapped == False): break# Driver code to test aboveif __name__ == "__main__": arr = [64, 34, 25, 12, 22, 11, 90] bubbleSort(arr) print("Sorted array:") for i in range(len(arr)): print("%d" % arr[i], end=" ")# This code is modified by Suraj krushna Yadav

// Optimized C# implementation of Bubble sortusing System;class GFG { // An optimized version of Bubble Sort static void bubbleSort(int[] arr, int n) { int i, j, temp; 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] and arr[j+1] temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; swapped = true; } } // If no two elements were // swapped by inner loop, then break if (swapped == false) break; } } // Function to print an array static void printArray(int[] arr, int size) { int i; for (i = 0; i < size; i++) Console.Write(arr[i] + " "); Console.WriteLine(); } // Driver method public static void Main() { int[] arr = { 64, 34, 25, 12, 22, 11, 90 }; int n = arr.Length; bubbleSort(arr, n); Console.WriteLine("Sorted array:"); printArray(arr, n); }}// This code is contributed by Sam007

// Optimized javaScript implementation// of Bubble sort// An optimized version of Bubble Sortfunction bubbleSort(arr, n){ var i, j, temp; var 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] and arr[j+1] temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; swapped = true; } } // IF no two elements were  // swapped by inner loop, then break if (swapped == false) break; }}// Function to print an array function printArray(arr, size){ var i; for (i = 0; i < size; i++) console.log(arr[i] + " ");}// Driver programvar arr = [ 64, 34, 25, 12, 22, 11, 90 ];var n = arr.length;bubbleSort(arr, n);console.log("Sorted array: ");printArray(arr, n);// This code is contributed shivanisinghss2110

<?php // PHP Optimized implementation// of Bubble sort// An optimized version of Bubble Sortfunction bubbleSort(&$arr){ $n = sizeof($arr); // Traverse through all array elements for($i = 0; $i < $n; $i++) { $swapped = False; // Last i elements are already // in place for ($j = 0; $j < $n - $i - 1; $j++) { // Traverse the array from 0 to // n-i-1. Swap if the element  // found is greater than the // next element if ($arr[$j] > $arr[$j+1]) { $t = $arr[$j]; $arr[$j] = $arr[$j+1]; $arr[$j+1] = $t; $swapped = True; } } // If no two elements were swapped // by inner loop, then break if ($swapped == False) break; }} // Driver code$arr = array(64, 34, 25, 12, 22, 11, 90); $len = sizeof($arr);bubbleSort($arr);echo "Sorted array: \n";for($i = 0; $i < $len; $i++) echo $arr[$i]." "; // This code is contributed by ChitraNayal.?>