Interactive analysis lab

Algorithm Comparison Dashboard

Speed

Step 1 / 64

0Comparisons

0Swaps / Writes

Start

Quick Sort begins with the full input array.

function quickSort(arr, low, high) {  if (low >= high) return;  const pivot = partition(arr, low, high);  quickSort(arr, low, pivot - 1);  quickSort(arr, pivot + 1, high);}

Step 1 / 91

0Comparisons

0Swaps / Writes

Start

Bubble Sort begins. It repeatedly steps through the list, comparing adjacent elements and swapping them if they are in the wrong order.

function bubbleSort(arr) {  for (let i = 0; i < n - 1; i++) {    for (let j = 0; j < n - 1 - i; j++) {      if (arr[j] > arr[j + 1])        swap(arr, j, j + 1);    }    if (!swapped) break;  }}