Hacker GitHub

← All repos

pbiggar/sorting-branches-caching

View on GitHub ↗ ★ 11 C

Research on sorting, esp. related to caching and branch prediction

4 mentions on Hacker News by 1 person: 0 stories, 4 comments · first 2012-10-12 · latest 2020-07-20

Mentions per year 4 mentions · busiest year 2012 (2)
20082026
AllStoriesComments NewestTopOldest
  1. …decade ago I did research on sorting and searching, which was the same type of work going on here ( https://github.com/pbiggar/sorting-branches-caching ). I found it was extremely difficult to accurately say whether one algorithm is faster…
    comment by pbiggar · 2020-07-20 · in Binary Search: A new implementation that is up to 25% faster
  2. …(3 in this case). Here's code for an LSB radix sort, which doesn't recurse, but is the same idea: https://github.com/pbiggar/sorting-branches-caching/blob/mas...
    comment by pbiggar · 2013-01-20 · in How to pair socks from a pile efficiently?
  3. Here's the actual sorts used in the paper: Insertion: https://github.com/pbiggar/sorting-branches-caching/blob/mas... Bubble: https://github.com/pbiggar/sorting-branches-caching/blob/mas... Insertion sort is significantly faster (esp in…
    comment by pbiggar · 2012-10-12 · in What’s really so bad about bubble sort?
  4. The code from the paper: https://github.com/pbiggar/sorting-branches-caching
    comment by pbiggar · 2012-10-12 · in What’s really so bad about bubble sort?