Why Selection Sort Algorithm in DSA Rust?

The Big Idea

What if you could sort your messy list by always picking the smallest piece first, step by step?

The Scenario

Imagine you have a messy pile of books on your desk, and you want to arrange them from the smallest to the biggest. You try to pick each book one by one and place it in the right order by guessing where it should go.

The Problem

Doing this by guessing is slow and confusing. You might pick the wrong book or forget where you put some. It takes a lot of time and mistakes happen easily.

The Solution

Selection Sort helps by always finding the smallest book left in the pile and putting it in the right place step by step. This way, you never guess, and the order grows correctly with each step.

Before vs After

✗ Before

let mut books = vec![5, 3, 8, 1];
// Guess and swap books randomly
books.swap(0, 2);
books.swap(1, 3);

✓ After

for i in 0..books.len() {
    let mut min_index = i;
    for j in i+1..books.len() {
        if books[j] < books[min_index] {
            min_index = j;
        }
    }
    books.swap(i, min_index);
}

What It Enables

It makes sorting simple and clear, so you can organize any list step by step without confusion.

Real Life Example

Sorting a list of student scores from lowest to highest to see who needs more help.

Key Takeaways

Manual guessing is slow and error-prone.

Selection Sort finds the smallest item each time and places it correctly.

This method is easy to understand and works well for small lists.

Practice

1. What is the main idea behind the Selection Sort Algorithm?

easy

A. Repeatedly find the smallest element and move it to the front

B. Divide the list into halves and sort each half separately

C. Swap adjacent elements if they are in wrong order

D. Insert each element into its correct position in a sorted sublist

Solution

1. Step 1: Understand selection sort process

   Selection sort finds the smallest element in the unsorted part and swaps it with the first unsorted element.

2. Step 2: Compare with options

   Repeatedly find the smallest element and move it to the front matches this description exactly, others describe different sorting methods.

3. Final Answer:

   Repeatedly find the smallest element and move it to the front -> Option A

4. Quick Check:

   Selection sort = find smallest and swap [OK]

Hint: Selection sort always picks smallest next element [OK]

Common Mistakes:

• Confusing selection sort with bubble sort
• Thinking it divides list into halves
• Mixing it up with insertion sort

2. Which of the following is the correct Rust syntax to swap two elements a[i] and a[min_index] in a vector a?

easy

A. a.swap_elements(i, min_index);

B. swap(a[i], a[min_index]);

C. a[i], a[min_index] = a[min_index], a[i];

D. a.swap(i, min_index);

Solution

1. Step 1: Recall Rust vector swap method

   Rust vectors have a method called swap that takes two indices and swaps their elements.

2. Step 2: Match syntax with options

   a.swap(i, min_index); uses a.swap(i, min_index); which is correct. Others are invalid Rust syntax or methods.

3. Final Answer:

   a.swap(i, min_index); -> Option D

4. Quick Check:

   Rust vector swap method = a.swap(i, j) [OK]

Hint: Use vector.swap(index1, index2) to swap elements [OK]

Common Mistakes:

• Trying to swap elements directly with assignment
• Using non-existent swap_elements method
• Using Python-style tuple swap syntax

3. What will be the output vector after running selection sort on vec![3, 1, 4, 2]?

medium

A. [1, 3, 2, 4]

B. [4, 3, 2, 1]

C. [1, 2, 3, 4]

D. [2, 1, 3, 4]

Solution

1. Step 1: Perform selection sort step-by-step

   Initial vector: [3, 1, 4, 2] - Find smallest (1), swap with first element: [1, 3, 4, 2] - Find smallest in remaining (3,4,2) is 2, swap with second element: [1, 2, 4, 3] - Find smallest in last two (4,3) is 3, swap with third element: [1, 2, 3, 4]

2. Step 2: Confirm final sorted vector

   The vector is sorted ascending: [1, 2, 3, 4]

3. Final Answer:

   [1, 2, 3, 4] -> Option C

4. Quick Check:

   Selection sort output = sorted ascending [OK]

Hint: Selection sort outputs sorted ascending list [OK]

Common Mistakes:

• Confusing selection sort with reverse sorting
• Stopping after first swap
• Not swapping correctly

4. Consider this Rust code snippet for selection sort. What is the bug?

fn selection_sort(a: &mut Vec<i32>) {
    let n = a.len();
    for i in 0..=n {
        let mut min_index = i;
        for j in i+1..n {
            if a[j] < a[min_index] {
                min_index = j;
            }
        }
        a.swap(i, min_index);
    }
}

medium

A. min_index should be initialized to 0, not i

B. The outer loop should run until n-1, not n

C. The swap method does not exist for vectors

D. The inner loop should start from 0, not i+1

Solution

1. Step 1: Analyze loop ranges

   The outer loop runs from 0 to n inclusive, meaning it runs n+1 times. But the last element does not need to be checked because it will already be sorted.

2. Step 2: Correct loop range for outer loop

   The outer loop should run from 0 to n-1 to avoid unnecessary iteration and potential out-of-bound errors.

3. Final Answer:

   The outer loop should run until n-1, not n -> Option B

4. Quick Check:

   Outer loop range = 0..n-1 [OK]

Hint: Outer loop runs to n-1, not n [OK]

Common Mistakes:

• Running outer loop one step too far
• Starting inner loop incorrectly
• Misunderstanding swap method existence

5. You want to sort a vector of integers but only partially: you want the first 3 smallest elements sorted at the front, and the rest can remain unsorted. How can you modify selection sort to do this efficiently?

hard

A. Run the outer loop only 3 times instead of full length

B. Run the inner loop only 3 times for each outer iteration

C. Sort the entire vector then shuffle last elements randomly

D. Use bubble sort for first 3 elements and selection sort for rest

Solution

1. Step 1: Understand partial sorting requirement

   We only want the first 3 smallest elements sorted at the front, so we only need to find and place the smallest element 3 times.

2. Step 2: Modify selection sort outer loop

   By running the outer loop 3 times, selection sort will place the 3 smallest elements in order at the front, leaving the rest unsorted.

3. Final Answer:

   Run the outer loop only 3 times instead of full length -> Option A

4. Quick Check:

   Partial sort = limit outer loop iterations [OK]

Hint: Limit outer loop to number of elements to sort [OK]

Common Mistakes:

• Modifying inner loop instead of outer loop
• Sorting entire vector unnecessarily
• Mixing sorting algorithms incorrectly