The best case runtime complexity of an algorithm that searches an array of size N is $\_\_\_\_\_.$

Question $13$ options:

O$($N$)$

O$($N$1)$

O$($N$/2)$

O$(1)$