I am confused whether if the BigO notation is O(n log n) or O(n^2). Normally a for-loop within a for-loop would make it O(n^2), but for this case the outter-for-loop's "i" increases by "i*=2", so it's now O(n log n). Is this true?

What is the big O notation of the following code (assume all variables have be declared with some initial values sum 0; for (int j-0; j