News Score: Score the News, Sort the News, Rewrite the Headlines

Binary Search Tree with SIMD

Recently, I've been looking at cache friendly algorithm for common data structures like trees, tries, ... One such algorithm kept coming up to mind and that's why I decided to implement it in Go. You can find the paper describing the algorithm here. The Intuition Let's assume that we have a binary tree: ┌────── 41 ──────┐ │ │ ┌──23──┐ ┌───61───┐ │ │ │ │ ┌─11─┐ ┌─31─┐ ┌─47─┐ ┌─73─┐ │ │ │ │ │ │ │ │ 2 19 29 37 43 53 67 79 A norm...

Read more at clement-jean.github.io

© News Score  score the news, sort the news, rewrite the headlines