11.1.5. Iterative Selection Sort Algorithm

Try these first

1. 1.

   What is the first step in the selection sort algorithm?

   Hint

   Think about how you would sort items manually.

2. 2.

   What is the time complexity of selection sort?

   Hint

   Consider how many comparisons are made for each element.

3. 3.

   What does selection sort do?

   • Sorts by exchanging adjacent elements
   • Selects the minimum element and swaps
   • Sorts using a divide and conquer approach

   Hint

   Focus on how selection sort operates.

4. 4.

   True or False: The time complexity of selection sort is O(log n).

   • True
   • False

   Hint

   Consider the number of comparisons made.

5. 5.

   Explain why selection sort is inefficient for large datasets and suggest a better sorting algorithm to use.

   Hint

   Think about how selection sort processes elements.

6. 6.

   Implement and test the selection sort algorithm in a programming language of your choice. Analyze the results on an array of various sizes.

   Hint

   Reflect on past sorting syntax you may have used.