Searching - General Questions

Linear search is preferable to binary search when:

Binary search on n sorted elements runs in:

Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 7, 8, 11, 14, 17, 20, 26, 29, 31, 35, 38, 41, 43, 50, 53, 56, 59, 63], how many comparisons with array elements are needed to find 41?

Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [2, 7, 8, 14, 15, 17, 27, 29, 31, 35, 43, 50, 51, 53, 55, 56, 59, 63, 79], how many comparisons with array elements are needed to find 43?

Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 5, 11, 19, 23, 27, 32, 35, 39], how many comparisons with array elements are needed to find 39?