Jump to content

Talk:Search data structure

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 20:25, 16 October 2009 (Dating comment by Trigger hurt - ""). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

I don't see how a sorted linked list has an insertion efficiency of O(1). Don't you have to find where to insert it? I think it's O(n).


As a corollary, deletion would also be O(n). Must traverse the list to find the item. Trigger hurt (talk) —Preceding undated comment added 20:24, 16 October 2009 (UTC).[reply]