How is bubble sort implemented in different programming languages?

Can you show me how bubble sort is implemented in Python?

Sure! Here's a simple implementation of bubble sort in Python:

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

This function sorts an array in ascending order.

What about in Java?

In Java, bubble sort can be implemented like this:

public class BubbleSort {
    public static void bubbleSort(int[] arr) {
        int n = arr.length;
        for (int i = 0; i < n-1; i++) {
            for (int j = 0; j < n-i-1; j++) {
                if (arr[j] > arr[j+1]) {
                    // swap arr[j+1] and arr[j]
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
    }
}

This will also sort the array in ascending order.

Can you give me an example in JavaScript?

Absolutely! Here's how you can implement bubble sort in JavaScript:

function bubbleSort(arr) {
    let n = arr.length;
    for (let i = 0; i < n-1; i++) {
        for (let j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                [arr[j], arr[j+1]] = [arr[j+1], arr[j]]; // swap
            }
        }
    }
    return arr;
}

This function will sort the array in ascending order as well.