你如何解决这个时间的复杂性?
int count=0; for (int i=1 ; i < n; i*=4) for (int j=1;j<=n;j++) count++;
algorithm big-o time-complexity
algorithm ×1
big-o ×1
time-complexity ×1