int i = 1; while (i < n/2) { i = i * 2; int j = i; while (j > 1) --j; }
c big-o time-complexity
big-o ×1
c ×1
time-complexity ×1