What is the complexity of a selection sort? A) O( n ²) B) O( n ) C) O(log₂ n ) D) O²

Name: What is the complexity of a selection sort? A) O( n 2 ) B) O( n ) C) O(log 2 n ) D) O 2
Brand: Quizplus
Rating: 4.9 (41 reviews)

Question

Quizplus · Accepted Answer

The complexity of selection sort is O(n^2), where n is the number of elements in the array to be sorted. This is because for each element, the algorithm scans the remaining elements to find the minimum/maximum, leading to a quadratic time complexity.

What Is the Complexity of a Selection Sort