3 ms·
You’re right it didn’t. I believe the main benefit vs binary search in arrays is that it’s linked list like nature makes insertion and removal Faster
by killingtime74 4y ago
You’re right it didn’t. I believe the main benefit vs binary search in arrays is that it’s linked list like nature makes insertion and removal Faster
- thesz 4y agoPlease consider COLA: http://people.seas.harvard.edu/~minilek/cs229r/fall13/lec/lec23.pdf http://people.seas.harvard.edu/~minilek/cs229r/fall13/lec/le... A hierarchy of sorted arrays, with merging when needed. Single access time is O(logN), scan is theoretically the fastest possible, inserts and deletes are also O(logN). Almost no pointer chasing.