hi, what is the no. of comparison in a worst case unsorted one-dimensional array of size N with linear search?

is it 'N'?

and if worst case sorted one-dimensional array of size N with binary search,

is it (log N / log2) ?

but what is best case in binary search?