11.1.6. Time Complexity of Selection Sort

Try these first

1. 1.

   What does selection sort do?

   Hint

   Think of how you might organize physical items by size.

2. 2.

   What is the time complexity of selection sort?

   Hint

   Remember how we calculate time complexity through operations.

3. 3.

   What is the primary purpose of selection sort?

   • To search an element
   • To sort an array
   • To find the median

   Hint

   Think back to what selection sort accomplishes.

4. 4.

   Selection sort uses a time complexity of O(n²). True or False?

   • True
   • False

   Hint

   Reflect on the comparisons made in the algorithm.

5. 5.

   Develop a program to implement selection sort both iteratively and recursively. Execute the algorithm on an array of your choice and print the sorted output.

   Hint

   Start with the iterative version, then adapt it for recursion.

6. 6.

   Given a large dataset, discuss when it would be more beneficial to use selection sort in practice despite its O(n²) complexity.

   Hint

   Think of scenarios involving specific types of data or logistical constraints.