Computer Chess Club Archives

Search

Messages

Subject: Linked list stuff

Author: Dann Corbit

Date: 12:13:13 04/07/99

I have seen some discussion on using linked lists for things.

If you want to use linked lists, I would suggest skiplists.
They use only about 1.3 pointers per element, give random access which is
O(log2(n)), and are very simple.  They were invented by Bill Pugh, and a web
search will turn up code for one in most any language.  Sequential access is
still O(1) also.  I have a C++ template I use for them.  They should have been
added to the STL.  Shrug.

• Re: Linked list stuff Hristo 14:26:48 04/07/99
  • Re: Linked list stuff Dann Corbit 14:46:21 04/07/99
    • Re: Linked list stuff Hristo 19:01:33 04/07/99
      • Re: Linked list stuff Dann Corbit 09:19:49 04/08/99
    • Re: Linked list stuff Hristo 15:16:26 04/07/99
• Re: Linked list stuff Dave Gomboc 13:28:49 04/07/99
  • Re: Linked list stuff Dann Corbit 14:23:13 04/07/99

This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.