|
|
|
|
|
by Sean1708
3309 days ago
|
|
As a very simple example see if you can spot the loop in the optimised version of a sum to n function[0] (hint: you can't). I don't know to what extent this scales up to more complex programs, but it is at least possible in principle. [0]: https://godbolt.org/g/dRUYA3 |
|
> https://godbolt.org/g/qmQhLK
Exercise: Write an assembly function that is faster than "-O3" and loop-free. Should be easy.