Amiah Winters

Mathematics

1 December, 06:35

Suppose that an element is known to be among the first four elements in an ordered list of 32. Would a linear search or a binary search locate this element more rapidly? Linear Search Now suppose it is know to be among the 5th through 8th elements in a list of 32 elements. On average, which search would be faster (in terms of number of comparisons) ? Binary Search Suppose that an element is known to be among the first four elements in an ordered list of 32. What is the worst case number of comparisons that will be done to locate the element with a linear search? Neglect any comparisons that are done to check whether or not you are still in the for loop. Choose ... Suppose that an element is known to be among the first four elements in an ordered list of 32. What is the worst case number of comparisons that will be done to locate the element with a binary search? Neglect any comparisons that are done to check whether or not you are still in the for loop Choose Check