ActionHydrong
@actionhydrong
Binary search is fast for reads, but slow for inserts. Balanced trees may be better for insert heavy operations.
0 reply
0 recast
0 reaction