insert-sort in combination with binary search and a mem-copy for the insertion is faster (with my particular test-data) than any of them. it isn't much, but it's noticable. unfortunately memcpy() isn't fair since it doesn't take care of any pick-beaurocracy -- but it certainly is faster than any piece-by-piece swapping or shifting.
Well, but it IS compatible with Moveable.
Actually, this is an interesting point w.r.t. to moving some of algorithms to containers. Obviously, if Sort would be Vector's method, it would be OK for it to use memmove...
Members
Pages
Help
Register
Login
Home
