Twitch https://twitch.tv/ThePrimeagen
Discord https://discord.gg/ThePrimeagen

Become Backend Dev: https://boot.dev/prime
(plus i make courses for them)

This is also the best way to support me is to support yourself becoming a better backend engineer.  

### LINKS 
https://curiouscoding.nl/posts/static-search-tree/
By: Ragnar Groot Koerkamp | https://x.com/curious_coding/

Great News?  Want me to research and create video????: https://www.reddit.com/r/ThePrimeagen

Kinesis Advantage 360: https://bit.ly/Prime-Kinesis

Get production ready SQLite with Turso: https://turso.tech/deeznuts

Primeagen's resource offers insights, tutorials, and resources for software developers and technology enthusiasts. Readers can learn about productivity hacks, career development strategies, and personal growth. With articles, videos, and practical advice, Primeagen provides  guidance and expertise for achieving professional success and fulfillment.

ThePrimeTime

The post discusses implementing an S+ tree to improve binary search speed. It explores optimizing code to enhance performance, leveraging techniques such as SIMD (Single Instruction, Multiple Data) instructions and batching queries. The focus is on achieving high throughput and optimizing memory usage, highlighting how various strategies can significantly speed up search operations.

40x Faster Binary Search

<p>In practice unless you are dealing with big data log 2(n) is fast enough and even the log 2(n) 10^15 (a petabyte is the usual entry point for big data) is less than 50.</p>
