September 2005
Volume 23 Number 9
FEATURES
The Ordersort Algorithm
Matthew Aitkenhead and Mark Richards
Ordersort is a list-sorting algorithm that's simple to implement in C++, and that sorts lists faster than the Quicksort and Bubblesort algorithms.
Implementing Splay Trees in C++
Ralf Mattethat
Splay trees are self-adjusting binary search trees that are typically used in caches, memory allocators, routers, garbage collectors, data compression, and the like.
Satisfying the Satisfiability Problem
Girish Keshav Palshikar
Girish surveysÑand implements in CÑalgorithms for the "satisfiable" problem, including the Davis-Putnam algorithm, GSAT algorithm, and simulated annealing algorithms.
Determinant Algorithm Generation with Numlists
Michael A. Jones
Numlists provide the compile-time index list structures that allow processing to happen in place. The compile-time nature of template recursion is key to coding this algorithm.
The Embedded C Extension to C: Part II
Marcel Beemster, Hans van Someren, Willem Wakker, and Walter Banks
In this installment of this two-part article, our authors present an example use of the Embedded C language extensions.
C++/CLI: Cloning
Rex Jaeschke
C++/CLI "cloning" capabilities let you make copies of heap-based objects.
COLUMNS
The New C++
Pete Becker
If you've never had to track down a program failure caused by a bad pointer, well, you're in for some treats.
Positive Integration
Matthew Wilson
In his previous installment, Matthew focused on code bloat in source code. This month, he looks at object code size.
Win32 GUI Generics
John Torjo
Windows should only implement their logic, while surfaces implement the drawing of the UI.
Agile C++
Christopher Diggins
Christopher introduces some specialized deletable unsmart pointer class templates.