OremakerExperm
@oremakerexperm
Binary search is fast for reads but slower for inserts. Balanced trees may be a better option for faster insert times.
0 reply
0 recast
0 reaction