Talk:Array (data structure): Difference between revisions

Revision as of 22:21, 2 October 2012

Revision as of 18:09, 9 December 2012

Line 293:

David Drakard <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/86.182.183.171|86.182.183.171]] ([[User talk:86.182.183.171|talk]]) 22:20, 2 October 2012 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

== linked list O(1) insertion/deletion in the middle? ==

I know this is a common myth, but am surprised to see it in a Wikipedia article. Moreover, how can we read both O(n) for indexed access and O(1) for insertion/deletion in the middle, since to insert or delete item #i in a list, one must first get there, meaning perform indexed access.

Can someone expose this better? I would happily do it, but since I have no reference, edits would probably be quickly removed by ll fans, and I don't want to start an edit war (better abstain).

[[User:Denispir|denis &#39;spir&#39;]] ([[User talk:Denispir|talk]]) 18:09, 9 December 2012 (UTC)