冒泡排序

1def bubble_sort(a):2    n = len(a)3    for i in range(n - 1):4        swapped = False5        for j in range(n - 1 - i):6            if a[j] > a[j + 1]:7                a[j], a[j + 1] = a[j + 1], a[j]8                swapped = True9        if not swapped:10            break  # no swaps means the list is already sorted11    return a12
13
14nums = [5, 1, 4, 2, 8]15print("Before:", nums)16bubble_sort(nums)17print("After: ", nums)

1function bubbleSort(a) {2    for (let end = a.length - 1; end > 0; end--) {3        let swapped = false;4        for (let j = 0; j < end; j++) {5            if (a[j] > a[j + 1]) {6                [a[j], a[j + 1]] = [a[j + 1], a[j]];7                swapped = true;8            }9        }10        if (!swapped) break; // Already sorted: stop early11    }12    return a;13}14
15const data = [5, 2, 9, 1, 7, 3];16console.log("Before:", data);17console.log("Sorted:", bubbleSort([...data]));

1import java.util.Arrays;2
3public class Main {4    static void bubbleSort(int[] arr) {5        for (int i = arr.length - 1; i > 0; i--) {6            boolean swapped = false;7            for (int j = 0; j < i; j++) {8                if (arr[j] > arr[j + 1]) {9                    int tmp = arr[j];10                    arr[j] = arr[j + 1];11                    arr[j + 1] = tmp;12                    swapped = true;13                }14            }15            if (!swapped) break; // already sorted16        }17    }18
19    public static void main(String[] args) {20        int[] arr = {5, 1, 4, 2, 8, 3};21        System.out.println("Before: " + Arrays.toString(arr));22        bubbleSort(arr);23        System.out.println("After:  " + Arrays.toString(arr));24    }25}

1#include <iostream>2#include <utility>3#include <vector>4
5void printVec(const std::vector<int>& a) {6    for (int x : a) std::cout << x << " ";7    std::cout << "\n";8}9
10void bubbleSort(std::vector<int>& a) {11    for (size_t pass = 0; pass + 1 < a.size(); ++pass) {12        bool swapped = false;13        // Each pass bubbles the largest remaining value to the end14        for (size_t j = 0; j + 1 < a.size() - pass; ++j) {15            if (a[j] > a[j + 1]) {16                std::swap(a[j], a[j + 1]);17                swapped = true;18            }19        }20        if (!swapped) break;  // already sorted21    }22}23
24int main() {25    std::vector<int> data = {5, 1, 4, 2, 8, 3};26    std::cout << "Before: ";27    printVec(data);28    bubbleSort(data);29    std::cout << "After:  ";30    printVec(data);31    return 0;32}

1#include <stdbool.h>2#include <stdio.h>3
4void printArr(const int a[], int n) {5    for (int i = 0; i < n; i++) printf("%d ", a[i]);6    printf("\n");7}8
9void bubbleSort(int a[], int n) {10    for (int pass = 0; pass < n - 1; pass++) {11        bool swapped = false;12        // Each pass bubbles the largest remaining value to the end13        for (int j = 0; j < n - 1 - pass; j++) {14            if (a[j] > a[j + 1]) {15                int tmp = a[j];16                a[j] = a[j + 1];17                a[j + 1] = tmp;18                swapped = true;19            }20        }21        if (!swapped) break;  // already sorted22    }23}24
25int main(void) {26    int data[] = {5, 1, 4, 2, 8, 3};27    int n = sizeof(data) / sizeof(data[0]);28    printf("Before: ");29    printArr(data, n);30    bubbleSort(data, n);31    printf("After:  ");32    printArr(data, n);33    return 0;34}

1DECLARE nums : ARRAY[1:7] OF INTEGER2DECLARE n : INTEGER3n ← 74nums[1] ← 75nums[2] ← 36nums[3] ← 97nums[4] ← 18nums[5] ← 59nums[6] ← 810nums[7] ← 211DECLARE i : INTEGER12DECLARE j : INTEGER13DECLARE temp : INTEGER14
15// Bubble the largest remaining value to the end on each pass16FOR i ← 1 TO n - 117    FOR j ← 1 TO n - i18        IF nums[j] > nums[j + 1] THEN19            temp ← nums[j]20            nums[j] ← nums[j + 1]21            nums[j + 1] ← temp22        ENDIF23    NEXT j24NEXT i25
26FOR i ← 1 TO n27    OUTPUT nums[i]28NEXT i