vvv48 (vvv48)

Checking - there’s nothing faster than a binary search is there unless you are also worried about insert time which means back trees right? Ie a slow indexing process that creates a simple ordered list for fast binary search is the most efficient for reads, but not inserts (as you have to re-sort the file each time)?

• 0 replies
• 0 recasts
• 0 reactions

recast:farcaster://casts/0x33bd40975acdbb59c585298a3884b725e6610b0997a8ce56de98d61ebe2189ff

• 0 replies
• 0 recasts
• 0 reactions

Unbothered.

• 0 replies
• 0 recasts
• 0 reactions

you will be blessed with degen and ham

• 0 replies
• 0 recasts
• 0 reactions