91影视

Why is the linear search also called 鈥渟equential search鈥�?

What is the maximum number of comparisons that a binary search function will make when searching for a value in a 1,000-element array?

Why is the bubble sort inefficient for large arrays?

Why is the selection sort more efficient than the bubble sort on large arrays?

The _________ search algorithm repeatedly divides the portion of an array being searched in half.

Complete the following table calculating the average and maximum number of comparisons the linear search will perform, and the maximum number of comparisons the binary search will perform. $$\begin{array}{l|lllll} \hline & 50 & 500 & 10,000 & 100,000 & 10,000,000 \\ \text { Array Size } \rightarrow & \text { Elements } & \text { Elements } & \text { Elements } & \text { Elements } & \text { Elements } \\ \hline \begin{array}{l} \text { Linear Search } \\ \text { (Average } \\ \text { Comparisons) } \end{array} & & & & \\ \hline \begin{array}{l} \text { Linear Search } \\ \text { (Maximum } \\ \text { Comparisons) } \end{array} & & & & & \\ \hline \begin{array}{l} \text { Binary Search } \\ \text { (Maximum } \\ \text { Comparisons) } \end{array} & & & & & \\ \hline \end{array}$$