What is the Worst case time complexity of the following algorithm?

void algorithm$($int n$)\{$

if $($ n $==0)$

$\{$

instruction$1$;

instruction;

return;

$\}$

algorithm$($n$/2)$;

$\}$

You Answered

O$($n$)$

O$($n$2)$

Correct Answer

O$($log$($n$))$

O$($nlog$($n$))$