Are you a Selection Sort Pro?

• A sorting algorithm that can only sort small data sets
• A complex sorting algorithm
• An in-place comparison-based sorting algorithm (correct)
• A sorting algorithm that requires additional memory

• Ο(nlogn)
• Ο(n2) (correct)
• Ο(1)
• Ο(n)

• It selects the largest element from the unsorted part and swaps it with the rightmost element in the sorted part.
• It selects the smallest element from the unsorted part and swaps it with the leftmost element in the sorted part. (correct)
• It scans the entire list and sorts the elements in descending order.
• It divides the list into two parts, the largest part at the left end and the smallest part at the right end.

<p>A sorting algorithm that divides the list into two parts, sorted and unsorted (A)</p> Signup and view all the answers

<p>Ο(n2) (C)</p> Signup and view all the answers

<p>The smallest element is selected from the unsorted array and swapped with the leftmost element (D)</p> Signup and view all the answers