Dumb question on time complexity

Revision en1, by Dumbledore, 2016-01-05 23:07:20 
for (int i = 1; i <= MAXN; i++)
     for (int j = i; j <= MAXN; j += i);


Can anybody explain to me why the time complexity for this code is O(N log N)?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Dumbledore 2016-01-05 23:07:20 214 Initial revision (published)