11.1. Selection Sort

Try these first

1. 1.

   What is the time complexity of Selection Sort?

   Hint

   Think about how many times we compare elements.

2. 2.

   Describe the first step of Selection Sort.

   Hint

   What do we look for in the first pass?

3. 3.

   What is the primary method of operation of Selection Sort?

   • A. Bubble and swap
   • B. Select and place
   • C. Insert in order

   Hint

   Think about how the elements are organized in selection sort.

4. 4.

   True or False: Selection Sort is more efficient than Merge Sort for large datasets.

   • True
   • False

   Hint

   How does the complexity of each algorithm stack up?

5. 5.

   Given an unsorted array of integers with negative numbers, implement Selection Sort and explain each iteration.

   Hint

   Pay close attention to negative numbers and their positions.

6. 6.

   Analyze the performance of Selection Sort by applying it to an already sorted array. How many iterations were needed and why?

   Hint

   Observe the swapping process carefully, even if no elements appear to change.