Sorting Stability and When to Use Which Sort in DSA Rust - 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 the following sorting code snippets.

// Bubble Sort (stable)
fn bubble_sort(arr: &mut [i32]) {
    let n = arr.len();
    for i in 0..n {
        for j in 0..n - i - 1 {
            if arr[j] > arr[j + 1] {
                arr.swap(j, j + 1);
            }
        }
    }
}

// Quick Sort (unstable)
fn quick_sort(arr: &mut [i32]) {
    if arr.len() <= 1 { return; }
    let pivot = arr[arr.len() / 2];
    let (mut left, mut right) = (0, arr.len() - 1);
    while left <= right {
        while arr[left] < pivot { left += 1; }
        while arr[right] > pivot { right -= 1; }
        if left <= right {
            arr.swap(left, right);
            left += 1;
            if right > 0 { right -= 1; }
        }
    }
    if right > 0 {
        quick_sort(&mut arr[0..=right]);
    }
    quick_sort(&mut arr[left..]);
}

These snippets show two common sorts: Bubble Sort which keeps equal items in order, and Quick Sort which is faster but may reorder equal items.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Bubble Sort uses nested loops to compare and swap adjacent items repeatedly. Quick Sort uses recursion and partitioning loops.
• How many times: Bubble Sort compares pairs roughly n×(n-1)/2 times. Quick Sort partitions and recurses about log n times on average.

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
10	Bubble: ~45, Quick: ~30
100	Bubble: ~4,950, Quick: ~664
1000	Bubble: ~499,500, Quick: ~9,966

Pattern observation: Bubble Sort operations grow very fast as n increases (square growth), while Quick Sort grows much slower (n log n growth).

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 may reorder equal items.

Common Mistake

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

[OK] Correct: Some fast sorts like Quick Sort can change the order of equal items, which matters when stability is needed.

Interview Connect

Understanding sorting time helps you choose the right method for your data and needs. Stability matters when order of equal items is important, and speed matters when data is large.

Self-Check

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

Practice

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

easy

A. It uses less memory than unstable sorts

B. It sorts elements in ascending order only

C. It always runs faster than unstable sorts

D. It keeps the original order of equal elements unchanged

Solution

1. Step 1: Understand stability in sorting

   A stable sort means if two elements are equal, their order stays the same as before sorting.

2. Step 2: Compare options with definition

   Only It keeps the original order of equal elements unchanged matches this meaning. Other options describe unrelated properties.

3. Final Answer:

   It keeps the original order of equal elements unchanged -> Option D

4. Quick Check:

   Stable sort = keeps equal elements order [OK]

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

Common Mistakes:

• Confusing stability with sorting order
• Thinking stability means faster sorting
• Assuming stability means less memory use

2. Which Rust standard library method sorts a slice with a stable sort without requiring a comparator closure?

easy

A. slice.sort_unstable_by()

B. slice.sort_unstable()

C. slice.sort()

D. slice.sort_by()

Solution

1. Step 1: Recall Rust slice sorting methods

   Rust's slice.sort() uses a stable sorting algorithm.

2. Step 2: Differentiate stable and unstable methods

   sort_unstable() and sort_unstable_by() are unstable sorts. sort_by() is stable but requires a comparator.

3. Final Answer:

   slice.sort() -> Option C

4. Quick Check:

   slice.sort() = stable sort [OK]

Hint: Use sort() for stable sorting in Rust [OK]

Common Mistakes:

• Choosing sort_unstable() thinking it's stable
• Confusing sort_by() with unstable sort
• Not knowing sort() is stable by default

3. Given the Rust code below, what is the output?

let mut data = [(3, 'a'), (1, 'b'), (3, 'c'), (2, 'd')];
data.sort();
println!("{:?}", data);

medium

A. [(1, 'b'), (2, 'd'), (3, 'a'), (3, 'c')]

B. [(1, 'b'), (2, 'd'), (3, 'c'), (3, 'a')]

C. [(3, 'a'), (3, 'c'), (2, 'd'), (1, 'b')]

D. [(2, 'd'), (1, 'b'), (3, 'a'), (3, 'c')]

Solution

1. Step 1: Understand sorting of tuples in Rust

   Rust sorts tuples by first element, then second if first are equal. Here, sorting by integer first.

2. Step 2: Apply stable sort to keep order of equal keys

   Elements with key 3 are (3, 'a') then (3, 'c'). Stable sort keeps this order.

3. Final Answer:

   [(1, 'b'), (2, 'd'), (3, 'a'), (3, 'c')] -> Option A

4. Quick Check:

   Stable sort keeps (3, 'a') before (3, 'c') [OK]

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

Common Mistakes:

• Swapping order of equal keys
• Ignoring tuple sorting rules
• Assuming unstable sort by default

4. The following Rust code uses sort_unstable() but the order of equal elements is important. What is the main issue?

let mut items = [(2, 'x'), (1, 'y'), (2, 'z')];
items.sort_unstable();
println!("{:?}", items);

medium

A. The code will not compile because sort_unstable() requires a comparator

B. The order of (2, 'x') and (2, 'z') may change, breaking stability

C. The code will panic at runtime due to unstable sort

D. The output will always be sorted and stable

Solution

1. Step 1: Understand sort_unstable() behavior

   sort_unstable() sorts faster but does not guarantee stable order of equal elements.

2. Step 2: Identify problem with equal keys

   Elements with key 2 may swap order, so (2, 'x') and (2, 'z') order can change, which breaks stability.

3. Final Answer:

   The order of (2, 'x') and (2, 'z') may change, breaking stability -> Option B

4. Quick Check:

   Unstable sort = order of equal keys can change [OK]

Hint: Unstable sort can reorder equal elements [OK]

Common Mistakes:

• Thinking unstable sort always panics
• Assuming unstable sort requires comparator
• Believing unstable sort keeps order

5. You have a list of student records with fields (score: i32, name: &str). You want to sort by score ascending but keep the original order of students with the same score. Which sorting method should you use in Rust and why?

hard

A. Use sort() because it is stable and preserves order of equal scores

B. Use sort_unstable() because it is faster and order doesn't matter

C. Use sort_unstable_by() with a custom comparator for stability

D. Use sort_by() but it is unstable so order may change

Solution

1. Step 1: Identify requirement for stability

   We want to keep original order of students with same score, so stable sort is needed.

2. Step 2: Choose Rust method that is stable

   sort() is stable and sorts ascending by default. sort_unstable() is faster but unstable. sort_unstable_by() is unstable even with comparator. sort_by() is stable but Use sort_by() but it is unstable so order may change claims it is unstable incorrectly.

3. Final Answer:

   Use sort() because it is stable and preserves order of equal scores -> Option A

4. Quick Check:

   Stable sort needed = use sort() [OK]

Hint: Stable sort keeps order of equal keys; use sort() [OK]

Common Mistakes:

• Choosing unstable sort for speed ignoring order
• Thinking sort_unstable_by() is stable
• Misunderstanding sort_by() stability