In Big-Oh notation, selection sort is a(n) ____ algorithm. A)O(1) B)O(n²) C)O(log n²) D)log n

Name: In Big-Oh notation, selection sort is a(n) ____ algorithm. A)O(1) B)O(n 2 ) C)O(log n 2 ) D)log n
Brand: Quizplus
Rating: 4.8 (23 reviews)

Question

Quizplus · Accepted Answer

Selection sort has a time complexity of O(n^2), which is represented by choice B in the given options. The other options (O(1), O(log n), and log n) do not represent the time complexity of selection sort.

In Big-Oh Notation, Selection Sort Is A(n) ____ Algorithm