Multiple Choice
We can measure the complexity of an algorithm that solves a computational problem by determining the number of for an input of size n.
A) times it loops
B) basic steps it requires
C) operations it performs
D) variables it uses
E) output statements it has
Correct Answer:
Verified
Correct Answer:
Verified
Q12: When sorting an array of objects, if
Q14: A(n)algorithm arranges data into some order.<br>A)sorting<br>B)searching<br>C)binary<br>D)linear<br>E)ordering
Q15: The linear search is adequate for searching
Q16: Selection sort requires passes to put n
Q17: Sorted data can be ordered<br>A)using a selection
Q20: To find a value that is in
Q21: A search can be performed on an
Q22: To determine that a item is not
Q22: If algorithm A requires 2n + 1
Q23: We can estimate the of an algorithm