If the target item is not in a $($non$-$empty$)$ list, then linear search and binary search are equally time$-$efficient.