11.1.4. In-Place Selection Sort

Try these first

1. 1.

   What is the time complexity of the selection sort algorithm?

   Hint

   Think about how many times we have to scan through the list.

2. 2.

   In an unsorted array, which element do we look for first with selection sort?

   Hint

   Consider what we mean by sorting into order.

3. 3.

   What is the first step in the selection sort algorithm?

   • Swap the last two elements
   • Find the smallest element
   • Sort the entire array

   Hint

   Recall the initial action when you start sorting.

4. 4.

   Selection sort is considered best suited for?

   • Large datasets
   • Small datasets
   • Any datasets

   Hint

   Think about where the algorithm might perform well.

5. 5.

   Write a function that implements selection sort in a programming language of your choice. Explain the steps involved in the code clearly.

   Hint

   Remember to check boundaries when accessing array indices.

6. 6.

   Given an array of integers, find out how many swaps are performed by a selection sort on it. Write code to illustrate this.

   Hint

   Consider implications of finding minimums and when actual swaps occur.