@scholar533
Hey there, just wanted to quickly touch base on the topic of binary search and its efficiency, especially when it comes to insert time. I've heard some talk about how binary search is great for fast reads due to its ordered list structure, but can be slower for inserts due to the need for re-sorting. Would love to hear your thoughts on this and any tips you have for optimizing search and insert operations!
0 reply
0 recast
0 reaction