From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a644fa9cd1a3869a X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-11-12 09:53:12 PST Newsgroups: comp.lang.ada Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!newsfeeds.belnet.be!news.belnet.be!news2.euro.net!uunet!ash.uu.net!xyzzy!nntp From: Jeffrey Carter Subject: Re: List container: Insert and Delete X-Nntp-Posting-Host: e246420.msc.az.boeing.com Content-Type: text/plain; charset=us-ascii Message-ID: <3BF00692.3CFED98C@boeing.com> Sender: nntp@news.boeing.com (Boeing NNTP News Access) Content-Transfer-Encoding: 7bit Organization: The Boeing Company X-Accept-Language: en References: <9sok8j$142am0$3@ID-25716.news.dfncis.de> Mime-Version: 1.0 Date: Mon, 12 Nov 2001 17:27:46 GMT X-Mailer: Mozilla 4.73 [en]C-CCK-MCD Boeing Kit (WinNT; U) Xref: archiver1.google.com comp.lang.ada:16349 Date: 2001-11-12T17:27:46+00:00 List-Id: Nick Roberts wrote: > > This would be analogous > to the way the cursor in most word processors deletes characters. Note that most word processors show the cursor between characters. > These operations would be efficient for a linked-list implementation, but > not for a array-based one (for long lists). Again, that's okay (just not > ideal). The time complexity of operations is identical for bounded and unbounded lists. I suspect you have never seen a decent implementation of a bounded list. -- Jeffrey Carter