41,554 blogs · 4,654,352 posts Claim your blog

Record · corpus.blog/posts/01a0ca6b-1a74-700a-b565-90ab76a56008

Dirty hands coding - High performance

dirtyhandscoding.github.io · published 4 August 2019

A record is what was published and who pointed at it. The text of the post is not held here: read it at the source, or at its Wayback capture.

Read the post at dirtyhandscoding.github.io Wayback capture

0blogs citing

First cited: —
Most recent: —
Rank this month: not ranked
External links: 8
Words captured: 433

Cited by

No blog we hold has cited this post yet.

Links from this post

Link

Host

https://stackoverflow.com/a/31683632/556899

stackoverflow.com

https://msdn.microsoft.com/en-us/library/bb531427(v=vs.120

msdn.microsoft.com

https://stackoverflow.com/questions/2786899/fastest-sort-of-fixed-length-6-int-array

stackoverflow.com

https://stackoverflow.com/questions/32172144/fastest-way-to-sort-10-numbers-numbers-are-32-bit

stackoverflow.com

https://stackoverflow.com/questions/19790522/very-fast-sorting-of-fixed-length-arrays-using-comparator-networks

stackoverflow.com

https://stackoverflow.com/questions/3901079/how-does-a-sorting-network-beat-generic-sorting-algorithms

stackoverflow.com

http://getpelican.com/

getpelican.com

https://github.com/blueicefield/pelican-blueidea/

github.com

Elsewhere on dirtyhandscoding.github.io (5)

utf8lut: Vectorized UTF-8 converter. Introduction Read at the source ↗

dirtyhandscoding.github.io

https://dirtyhandscoding.github.io/category/%7Bfilename%7D1_avx2_merge.md

dirtyhandscoding.github.io

Vectorizing small fixed-size sort Read at the source ↗

dirtyhandscoding.github.io

Performance comparison: linear search vs binary search Read at the source ↗

dirtyhandscoding.github.io

Addendum to Performance comparison: linear search vs binary search Read at the source ↗

dirtyhandscoding.github.io