What is the worst$-$case time complexity of the following algorithm?

int total $=0$;

for $($int k $=1$; k $<$ n; k$++)$

$\{$

for $($int j $=$ n; j $>1$; j $=$ j $/2)$

total $=$ total$+1$;

$\}$