Which of the following best describes the selection sort algorithm?

  • Algorithm based on priority queues
  • In-place algorithm with no comparisons
  • Recursive algorithm using subproblems
  • Sorting algorithm that divides the list into two parts: sorted and unsorted
The selection sort algorithm is a simple sorting algorithm that divides the input list into two parts: a sorted and an unsorted portion. It repeatedly selects the smallest (or largest) element from the unsorted part and swaps it with the first element of the unsorted part.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *