Sorting Stability and When to Use Which Sort in DSA Javascript - Time & Space Complexity

Time Complexity: Sorting Stability and When to Use Which Sort

O(n^2) for Bubble Sort, O(n log n) average for Quick Sort

Understanding Time Complexity

Sorting is a common task where we arrange items in order. Knowing how long different sorting methods take helps us pick the best one.

We want to understand how the time to sort grows as the list gets bigger and when to choose each sort.

Scenario Under Consideration

Analyze the time complexity of these sorting methods.

// Example: Bubble Sort (stable)
function bubbleSort(arr) {
  for (let i = 0; i < arr.length - 1; i++) {
    for (let j = 0; j < arr.length - 1 - i; j++) {
      if (arr[j] > arr[j + 1]) {
        [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
      }
    }
  }
  return arr;
}

// Example: Quick Sort (unstable)
function quickSort(arr) {
  if (arr.length <= 1) return arr;
  const pivot = arr[arr.length - 1];
  const left = arr.filter(x => x < pivot);
  const right = arr.filter(x => x > pivot);
  const equal = arr.filter(x => x === pivot);
  return [...quickSort(left), ...equal, ...quickSort(right)];
}
    

Bubble Sort is stable and simple but slower; Quick Sort is faster on average but unstable.

Identify Repeating Operations

Look at the loops and recursive calls that repeat work.

• Bubble Sort: Nested loops comparing and swapping elements repeatedly.
• Quick Sort: Recursive calls splitting the array and filtering elements.
• Dominant operation: Comparisons and swaps in Bubble Sort; recursive splits and filtering in Quick Sort.

How Execution Grows With Input

As the list grows, Bubble Sort does many more comparisons, while Quick Sort splits the list efficiently.

Input Size (n)	Approx. Operations Bubble Sort	Approx. Operations Quick Sort
10	~100 (10*10)	~30 (10 log 10)
100	~10,000 (100*100)	~700 (100 log 100)
1000	~1,000,000 (1000*1000)	~10,000 (1000 log 1000)

Bubble Sort grows much faster, roughly by the square of input size; Quick Sort grows slower, roughly input size times log of input size.

Final Time Complexity

Time Complexity: O(n²) for Bubble Sort, O(n log n) average for Quick Sort

Bubble Sort takes much longer as the list grows, while Quick Sort is faster but can be slower in the worst case.

Common Mistake

[X] Wrong: "Faster sorting always means stable sorting."

[OK] Correct: Some fast sorts like Quick Sort are unstable, meaning equal items can change order, which matters in some cases.

Interview Connect

Understanding when to use stable or unstable sorts and their time costs shows you know how to pick the right tool for the job, a key skill in coding interviews.

Self-Check

"What if we used Merge Sort instead of Quick Sort? How would the time complexity and stability change?"

Practice

1. What does it mean when a sorting algorithm is stable?

easy

A. It keeps the original order of equal elements after sorting

B. It sorts elements faster than unstable algorithms

C. It uses less memory than unstable algorithms

D. It always sorts in ascending order

Solution

1. Step 1: Understand stability in sorting

   A stable sort keeps the relative order of items with equal keys unchanged.

2. Step 2: Compare with other options

   Speed, memory use, or sorting order do not define stability.

3. Final Answer:

   It keeps the original order of equal elements after sorting -> Option A

4. Quick Check:

   Stable sort = keeps equal elements order [OK]

Hint: Stable means equal items keep their original order [OK]

Common Mistakes:

• Confusing stability with speed
• Thinking stability means sorting ascending only
• Assuming stable sorts use less memory

2. Which of the following is the correct way to call JavaScript's built-in sort method to sort numbers in ascending order?

easy

A. arr.sort()

B. arr.sort((a, b) => a + b)

C. arr.sort((a, b) => b - a)

D. arr.sort((a, b) => a - b)

Solution

1. Step 1: Understand JavaScript's default sort

   By default, arr.sort() sorts elements as strings, not numbers.

2. Step 2: Use compare function for numeric ascending

   The compare function (a, b) => a - b sorts numbers ascending correctly.

3. Final Answer:

   arr.sort((a, b) => a - b) -> Option D

4. Quick Check:

   Numeric ascending sort uses (a, b) => a - b [OK]

Hint: Use (a, b) => a - b for ascending numeric sort [OK]

Common Mistakes:

• Using arr.sort() alone for numbers
• Using (a, b) => b - a for ascending order
• Using (a, b) => a + b which is invalid

3. Consider the array of objects:

const items = [
  {name: 'apple', price: 50},
  {name: 'banana', price: 20},
  {name: 'cherry', price: 50},
  {name: 'date', price: 20}
];
items.sort((a, b) => a.price - b.price);

What will be the order of items after sorting?

medium

A. [{banana,20}, {date,20}, {cherry,50}, {apple,50}]

B. [{date,20}, {banana,20}, {cherry,50}, {apple,50}]

C. [{banana,20}, {date,20}, {apple,50}, {cherry,50}]

D. [{date,20}, {banana,20}, {apple,50}, {cherry,50}]

Solution

1. Step 1: Understand the sort comparator

   The comparator sorts by price ascending: 20 then 50.

2. Step 2: Check stability of JavaScript sort

   JavaScript's sort is stable in modern engines, so equal price items keep original order.

3. Step 3: Apply stability to equal price items

   For price 20, original order is banana then date; for 50, apple then cherry.

4. Final Answer:

   [{banana,20}, {date,20}, {apple,50}, {cherry,50}] -> Option C

5. Quick Check:

   Stable sort keeps equal price order [OK]

Hint: Stable sort keeps original order of equal keys [OK]

Common Mistakes:

• Assuming unstable sort changes order of equal items
• Mixing up banana and date order
• Ignoring stability of JavaScript sort

4. The following code tries to sort an array of strings by length, which may not keep the original order of equal length strings:

const arr = ['bat', 'cat', 'apple', 'dog'];
arr.sort((a, b) => a.length - b.length);

What is the main reason the original order of equal length strings might not be preserved?

medium

A. Strings cannot be sorted by length

B. JavaScript's sort is unstable in some engines

C. The comparator function is incorrect

D. The array contains duplicates

Solution

1. Step 1: Check comparator correctness

   The comparator (a, b) => a.length - b.length correctly compares string lengths.

2. Step 2: Understand JavaScript sort stability

   JavaScript's sort is stable in modern engines but may be unstable in older engines, causing order change.

3. Final Answer:

   JavaScript's sort is unstable in some engines -> Option B

4. Quick Check:

   Unstable sort breaks equal element order [OK]

Hint: Old JS engines have unstable sort, losing order [OK]

Common Mistakes:

• Blaming comparator function
• Thinking strings can't be sorted by length
• Assuming duplicates cause instability

5. You have a list of student records with name and score. You want to sort by score ascending but keep the original order for students with the same score. Which sorting algorithm should you choose and why?

hard

A. MergeSort, because it is stable and sorts efficiently

B. QuickSort, because it is fast but unstable

C. HeapSort, because it uses less memory

D. BubbleSort, because it is simple and stable

Solution

1. Step 1: Identify need for stability

   We want to keep original order for equal scores, so stability is required.

2. Step 2: Choose algorithm with stability and efficiency

   MergeSort is stable and efficient (O(n log n)), suitable for this task.

3. Step 3: Compare other options

   QuickSort is fast but unstable; HeapSort is unstable; BubbleSort is stable but inefficient.

4. Final Answer:

   MergeSort, because it is stable and sorts efficiently -> Option A

5. Quick Check:

   Stable + efficient = MergeSort [OK]

Hint: Stable and efficient sort for equal keys: MergeSort [OK]

Common Mistakes:

• Choosing QuickSort ignoring instability
• Picking BubbleSort despite inefficiency
• Confusing HeapSort as stable