Sorting Algorithms (bubble sort, merge sort)

What aspect of sorting algorithms does this code help analyze?

function compareSort(arr) {
  const arr1 = [...arr];
  const arr2 = [...arr];
  console.time('bubble');
  bubbleSort(arr1);
  console.timeEnd('bubble');
  console.time('merge');
  mergeSort(arr2);
  console.timeEnd('merge');
}

Space complexity
Time complexity
This code analyzes practical time complexity by: 1) Creating identical array copies for fair comparison, 2) Measuring actual execution time of each algorithm, 3) Using console.time for precise timing, 4) Enabling direct performance comparison, 5) Demonstrating real-world performance differences, 6) Useful for algorithm selection decisions, 7) Helps understand theoretical vs practical performance, 8) Common approach for algorithm benchmarking.
Algorithm stability
Code readability

Next Question (10/20)