News for hackers. Stuff that matters.

A comment on Why is processing a sorted array faster than an unsorted array?. Parent comment

Re:Why is processing a sorted array faster than an unsorted ... by a-priori on Wednesday October 10, 2012 @03:58PM (#4637893)
Yes, it's always possible to write assembly code that is at least as fast as C code, if not faster.

But it's entirely another question whether you, as a mere mortal human, are able to do a better job at producing assembly code in practice, for non-trivial programs, than a compiler.

[ Parent | on HN ]
Re:Why is processing a sorted array faster than an unsorted ... by jwilliams on Wednesday October 10, 2012 @04:33PM (#4638055)
Think we completely agree.

It's pretty much demonstrated by the update to the piece -- certain compliers & compiler flags did produce the right optimization, whereas the original author did not.

[ Parent | on HN ]