Apropos of...

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)?

Tradfi coder by day, hacker by night. Doesn’t know night from day. Freelance scribe. Dad cook. Dog butler.  Happy Grandpa. Draws badly.

Tren doi nay ngoai sinh tu ra moi su deu la chuyen nho.