id:

1. True or false: Binary search is generally faster than linear search on a sorted array. true false

2. True or false: You can always use binary search on any array. true false

in the array:

int[] grades = {34,37,40,44,45,47,55};

3. If we search for 37 using binary search, the first value we will check is:

34 40 44 45 55

4. Think... In a sorted array, Linear search is faster than binary search when

the value is at the beginning the value is at the end the value is in the middle the value is not there It is never faster