Simple sorting algorithms in JavaScript

bubbleSort.js

var testArr = [4, 2, 6, 8, 1, 3, 7, 5];

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

bubbleSort(testArr);

selectSort.js

var testArr = [4, 2, 6, 8, 1, 3, 7, 5];

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

selectionSort(testArr);