Author: Dave Gomboc
Date: 13:28:49 04/07/99
Go up one level in this thread
On April 07, 1999 at 15:13:13, Dann Corbit wrote: >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. If it's in STL form, contribute it to SGI! Are you sure their list and slist are not already based on skip lists? Dave Gomboc
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.