User contributions
Jump to navigation
Jump to search
- 23:31, 26 April 2012 diff hist +477 Template:List data structure comparison search time is _the_ huge tradeoff for linked lists. In theory the memory isn't fragmented. In reality memory is fragmented so while searching through the list you are maximising cache misses. Arrays are faster in insert/delete because of search time