#111 Selection Sort

What type of sorting algorithm is Selection Sort described as?

•  An out-of-place non-comparison algorithm

  
  

• An in-place comparison sorting algorithm

  
  

• A recursive divide-and-conquer algorithm

• A distributed sorting algorithm

In the analogy used to explain Selection Sort, what objects represent the array elements?

• Flashlights

  
  

• Numbers

  
  

• Closed boxes

  
  

• Attic items

  
  

During each iteration of Selection Sort, what does the algorithm keep track of?

• The maximum value

  
  

• The average value

  
  

• The median value

  
  

• The minimum value

  
  

What action is performed at the end of each iteration in Selection Sort?

• Splitting the array

  
  

• Merging subarrays

  
  

• Variable swapping

  
  

• Reversing the order

How does the efficiency of Selection Sort change as the data set size increases?

•  It becomes more efficient

  
  

• It becomes less efficient

  
  

• Its efficiency remains constant

  
  

• It becomes logarithmically more efficient

  
  

In the outer loop of the Selection Sort implementation, what is the loop condition?

• i < array.length

  
  

•  i < array.length - 1

  
  

•  i <= array.length

  
  

•  i <= array.length - 1

  
  

What variable is used to keep track of the current minimum index in the implementation?

• i

• j

• min

• temp

How can the implementation be modified to sort the array in descending order instead of ascending order?

• Change the outer loop condition

  
  

• Swap the inner and outer loops

  
  

• Change the greater than sign to a less than sign in the comparison

  
  

• Reverse the array after sorting