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
Q5: Which of the following algorithms has a
Q6: Bubble sort is the most efficient searching
Q7: The _ algorithm sorts a list of
Q8: As the number of items in a
Q9: The _ algorithm sorts values by repeatedly
Q11: If there are more items in a
Q12: A linear search always requires more comparisons
Q13: Every algorithm for a problem has the
Q14: A _ search looks through the search
Q15: Which of the following algorithms has a
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents