IT Challenges
Region: IT
Tuesday 11 August 2026 11:43:30 GMT
8684
137
11
8
Music
Download
Comments
Someoneontheinternet :
why not show the assembly for ++n too
2026-08-11 12:34:26
3
SQ_Minion :
I simply keep an array of all integers in memory and move forwards and backwards through it as needed
2026-08-30 21:35:20
2
𝐁𝐈𝐊𝐄𝐑𝐈𝐍𝐎 🤍𝐑𝟔❤️ :
if you use -o2 ...
2026-08-11 20:03:29
0
Krzycho :
why did you use -O3? That could be the reason why any possible difference in generated assembly (if present) was erased during optimization. The compiler could have automatically detected the pattern and generate the most optimal machine code with desired outcome (and since both functions are expected to do exactly the same, the optimized code is the same)
2026-09-19 10:53:32
0
Andy😎 :
If you compile with a good optimization you will see how unnecessary complicated your initial code was 😂
2026-08-12 11:34:09
0
Keyboardpunk :
it does not tell anything. you need to show how the computer ressolve the syntax to be assembly code. n=n+1 might need more instruction to execute because it contain 6 elements. which require 6 loops at least
2026-08-12 23:30:10
0
To see more videos from user @itchallenges, please go to the Tikwm
homepage.
