What is the complexity of the selection sort algorithm in the best case scenario?
a. O(n^2)
b. O(1)
c. O(n)
d. O(log (n))
a. O(n^2)
Selection sort has O(n^2) complexity; it doesn't matter if the input is sorted or unsorted.
Computer Science & Information Technology
You might also like to view...
When you set a print area, the range of selected cells is named Selected_Area
Indicate whether the statement is true or false.
Computer Science & Information Technology
Explain what the kernel must provide for a user-level implementation of threads, such as Java on UNIX.
What will be an ideal response?
Computer Science & Information Technology