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

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

if $)==(0$

$\{$

instruction$1$;

instruction;

return;

$\}$

algorithm$($n$/2)$;

$\}$