Multiple Choice
Which of the following algorithms has a time complexity of O(log2 n) ?
A) insertion sort
B) selection sort
C) bubble sort
D) linear search
E) binary search
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q7: What is the complexity of the following
Q8: As the number of items in a
Q9: Write out the state while being sorted
Q10: Which of the following is not a
Q11: Explain what O(1) means.
Q13: A linear search is more efficient than
Q14: Bubble sort is the most efficient searching
Q15: Suppose we have algorithms that solve a
Q16: In the binary search algorithm, if the
Q17: A _ search is more efficient than