java quiz chapter 22
¡Supera tus tareas y exámenes ahora con Quizwiz!
For a sorted list of 1024 elements, a binary search takes at most ________ comparisons.
11
The worst-time complexity for binary search is ________.
O(logn)
The worst-time complexity for linear search is ________.
O(n)
An input that results in the shortest execution time is called the ________.
best-case input
O(1) is ________.
constant time
On an average, linear search searches ________.
half of the list
O(n) is ________.
linear time
O(nlong) is ________.
log-linear time
O(n*n) is ________.
quadratic time
Estimating algorithm efficiency is ________.
to estimate their growth function
