Algorithm Complexity Visualizer

1function bubbleSort(arr) {
2  for (let i = 0; i < arr.length; i++) {
3    for (let j = 0; j < arr.length - i - 1; j++) {
4      if (arr[j] > arr[j + 1]) {
5        swap(arr, j, j + 1);
6      }
7    }
8  }
9  return arr;
10}