What is the order of growth of the running time $($in N$)$ of the following code fragment:

int sum $=$ N;

for $($int i $=0$; i $<$ N; i $*=4)$

for $($int j $=0$; j $<$ N; j$++)$

sum$--$;