Bubble sort implement using JavaScript

BubbleSort.js

var arr = [10, 55, 20, 4, 28, 69, 22, 85, 7, 37];

function bubbleSort(arr)
{
    var temp, i, j;

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

    return arr;
}

console.log(bubbleSort(arr));

Bubble Sort
Description: Repeatedly swaps adjacent elements if they are in the wrong order.
Time Complexity: O(n²)
Use Case: Simple but inefficient for large datasets.