Multiple Choice
Selection sort is a(n) ____ algorithm in all cases.
A) 1
B) Q (n)
C) Q (2n)
D) Q (n2)
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q15: The brute-force bin-packing algorithm is very useful.
Q16: What is the unit of work in
Q17: The time/space tradeoff is the choice between
Q18: It is sufficient for an algorithm to
Q19: The problem of placing objects in alphabetical
Q21: Q (n) and Q (n<sup>2</sup>) are _
Q22: The converging-pointers algorithm is _ in the
Q22: With sequential search, the <u>bigger</u> the list
Q25: Ease of understanding, elegance, efficiency, and correctness
Q42: _ is the algorithmic equivalence of style.<br>A)