1. Data structures

Algorithms are usually seen as the basis of programming, but data structures are just as important. I will discuss data structures on two levels: interface and implementation. Interface specifies the operations that can take place on a data structure, while implementation defines the physical memory layout and will determine things such as the speed of individual operations.


  1. Linked lists
  2. Trees
  3. Hash tables
  4. Circular queues
  5. Bulk move queues
  6. Heaps


  1. Stacks
  2. Queues
  3. Priority queues

[Prev] [Next] [Up]

Last updated Sun Nov 28 22:04:38.0000000000 2004. Copyright Bruce Merry (bmerry '@' gmail dot. com).