If an unsorted list of numbers is to be searched for a particular number only once, which of the following is more efficient (faster) ? Group of answer choices Do not sort the list. Do a bisection search. Sort the list first, then do a bisection search. Do not sort the list. Do a linear search. Sort the list first, then do a linear search.

Question

Computers and Technology

Karissa Clayton

20 May, 15:08

If an unsorted list of numbers is to be searched for a particular number only once, which of the following is more efficient (faster) ? Group of answer choices Do not sort the list. Do a bisection search. Sort the list first, then do a bisection search. Do not sort the list. Do a linear search. Sort the list first, then do a linear search.

+1

Answers (1)

Know the Answer?

Zuniga · Answer 1

Sort the list first, then do a bisection search

Explanation:

In bisection search method, we divide the array of numbers in two equal parts. Then we check that the number is exist in first half or second half. It is necessary to perform this operation that array should sorted. This is the fast searching algorithm as compared to Linear search. In linear search Algorithm we have to check every element in the array until we find the required number. The bisection search method is faster as compare to linear search. This follows following steps top complete the operation of searching.

Sort the array Divide the total array in two equal parts Check that the required number that we want to search is in first half or second half If the number is found in first half then second half of array will be discarded. Then repeat step 2 and 3 until not found the required element.