Limited access

Upgrade to access all content for this subject

Given the following sorted array:

int[] nums = {2, 3, 6, 19, 22, 35, 44, 50, 69, 75, 82};

For which of the following scenarios would a sequential search take fewer passes to find the number than a typical binary search?

A

When searching for any of the numbers 2, 22, or 69.

B

When searching for the number 3.

C

When searching for the number 70.

D

When searching for the number 35.

E

When searching for the number 6.

Select an assignment template