三种主流编程语言实现冒泡排序

C

#include <stdio.h>
void bubbleSort(int arr[], int n) 
{
    for (int i = 0; i < n-1; i++) 
    {
            for (int j = 0; j < n-i-1; j++) 
            {
                        if (arr[j] > arr[j+1]) 
                        {
                                        int temp = arr[j];                     
                                        arr[j] = arr[j+1];                
                                        arr[j+1] = temp;
                        }
            } 
     }    
}
int main() 
{
    int arr[] = {64, 34, 25, 12, 22, 11, 90};    
    int n = sizeof(arr)/sizeof(arr[0]);    
    bubbleSort(arr, n);    
    printf("排序后的数组：");    f
    or (int i = 0; i < n; i++) 
    {
            printf("%d ", arr[i]);
    }    
    return 0;
}

Python

def bubbleSort(arr):
    n = len(arr)    
    for i in range(n-1):
            for j in range(n-i-1):
                        if arr[j] > arr[j+1]:
                                        arr[j], arr[j+1] = arr[j+1], arr[j]
arr = [64, 34, 25, 12, 22, 11, 90]
bubbleSort(arr)
print("排序后的数组：", arr)

JavaScript

function bubbleSort(arr) {
    var n = arr.length;
    for (var i = 0; i < n-1; i++) {
        for (var j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                var temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
}

var arr = [64, 34, 25, 12, 22, 11, 90];
bubbleSort(arr);
console.log("排序后的数组：", arr);