User contributions

For 84.63.126.207 talk block log logs
Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼-contribs-top⧽
⧼-contribs-date⧽

  • 23:31, 26 April 2012 diff hist +477 Template:List data structure comparisonsearch 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