Re: stl skipping algorithms

Tech Tip: Click here to run a free scan for Windows Errors and optimize PC performance

Super Giraffe <muzmail@xxxxxxxxx> wrote:
The reason I think that an STL skipping algorithm would be faster is
because another part of my code was improved by replacing an
element-wise copy with the std::copy algorithm.

std::copy performs element by element copy in a loop - you can look at
the source code and see for yourself. No black magic involved. If there
really was an improvement, it must have come from something else.
--
With best wishes,
Igor Tandetnik

With sufficient thrust, pigs fly just fine. However, this is not
necessarily a good idea. It is hard to be sure where they are going to
land, and it could be dangerous sitting under them as they fly
overhead. -- RFC 1925


.

Relevant Pages

  • Re: Thinking assembly?
    ... >> Replacing it by an Oalgorithm in a HLL will give ... analysis class will tell you ), replacing an Oalgorithm by ... Big-Oh notation) need to be reasonable. ... of finding that lower-term algorithm in a HLL, ...
    (alt.lang.asm)
  • Re: How long to trust 3DES
    ... time so we can make a logical business decision about replacing the ... algorithm. ... Any comments or advice would be welcome. ...
    (sci.crypt)