11.1.2. Strategy for Sorting

Try these first

1. 1.

   What is Selection Sort?

   Hint

   Think about how you arrange numbers in order.

2. 2.

   What is the time complexity of Selection Sort?

   Hint

   Consider how many times you loop through the list.

3. 3.

   What is the main advantage of sorting an array?

   • It makes it easier to search for elements
   • It increases memory usage
   • It complicates retrieval

   Hint

   Think about how you find items in a sorted list versus an unsorted one.

4. 4.

   Is Selection Sort an efficient algorithm for large datasets?

   • True
   • False

   Hint

   Consider how many iterations are involved in Selection Sort.

5. 5.

   Implement Selection Sort in Python and test it with an unsorted array of random numbers.

   Hint

   Remember to iterate through the list multiple times, finding and swapping the minimum.

6. 6.

   Given a list of integers sorted in descending order, apply Selection Sort and note the performance. What do you observe?

   Hint

   Consider how looking for the minimum is different in a list that's already sorted.