bubble sort

function bubbleSort(arr) {
    let temp;
    let swapped = false

    for (let i = 0; i < arr.length; i++) {
      // If the current value is greater than its neighbor to the right
      if (arr[i] > arr[i + 1]) {
        // Swap those values
        temp = arr[i];
        arr[i] = arr[i + 1];
        arr[i + 1] = temp
        swapped = true
      }
    }


    // If you get to the end of the array and no swaps have occurred, return
    if (!swapped) {
      return arr
    }

    // Otherwise, repeat from the beginning
    return bubbleSort(arr)

}

// bubbleSort([9, 3, 2, 6, 1])