m=1; for(i=1;i<=n;i++){ m=m*2; for(j=1;j<=m;j++){ do something that is O(1) } }
上面代码的时间复杂度是多少?请告诉我如何解决这些类型的问题.
algorithm time asymptotic-complexity
algorithm ×1
asymptotic-complexity ×1
time ×1