11.1.8. Recursive Time Complexity

Try these first

1. 1.

   What does selection sort do?

   Hint

   Think about the process of finding the smallest element.

2. 2.

   What is the time complexity of selection sort?

   Hint

   Consider how many comparisons are made in the algorithm.

3. 3.

   What is the key operation of the selection sort algorithm?

   • Finding the maximum
   • Finding the minimum
   • Counting elements

   Hint

   Think about the sorting order.

4. 4.

   True or False: The time complexity of selection sort is linear.

   • True
   • False

   Hint

   Recall the comparisons made in sorting.

5. 5.

   Suppose you need to sort an array of 5000 random integers using selection sort. What will be the computational challenges compared to using a more advanced sorting algorithm?

   Hint

   Consider the nature of how selection sort works versus more advanced algorithms.

6. 6.

   Design a hybrid algorithm that combines selection sort with other techniques to improve efficiency on partially sorted arrays.

   Hint

   Think about reducing comparisons on pre-sorted data.