<p dir="ltr"><br /> On 9 Dec 2015 02:44, "Peter Geoghegan" <<a href="mailto:pg@heroku.com">pg@heroku.com</a>>
wrote:<br/> ><br /> > I guess you mean insertion sort. What's the theoretical justification<br /> > for the
change?<pdir="ltr">Er, right. Insertion sort.<p dir="ltr">The sort networks I used here are optimal both in number of
comparisonsand depth. I suspect modern CPUs actually manage to do some of the comparisons in parallel even. <p
dir="ltr">Iwas experimenting with using SIMD registers and did a non SIMD implementation like this first and noticed it
wasdoing 15% fewer comparisons than insertion sort and ran faster. That was for sets of 8, I'm not sure there's as much
savingon smaller sets. <br />