What is the efficiency of selection sort?
A)O(n2).
B)O(n log n).
C)O(n).
D)O(1).

Name: What is the efficiency of selection sort? A)O(n2). B)O(n log n). C)O(n). D)O(1).
Brand: Quizplus
Rating: 4.8 (32 reviews)

Question

Quizplus · Accepted Answer

The efficiency of selection sort is O(n2), which means that the time complexity of the algorithm grows at an exponential rate with the size of the input. This makes it a relatively inefficient algorithm for large sets of data, although it can be adequate for small datasets or for educational purposes.

What Is the Efficiency of Selection Sort