Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings
Title Downloads

Enhance Your Code Performance: Effective Data Structures Techniques in Mathematica

Daniel Lichtblau
Organization: Wolfram Research, Inc.

1999 Mathematica Developer Conference
Conference location

Champaign, IL

Many people routinely make good use of Mathematica's built-in functions. It is less well known when and how to utilize more exotic programming methodologies such as hash tables, tree structures, and variable-length arrays. Moreover, Mathematica's evaluation semantics can lead to performance problems for naive implementations of these methodologies. In a few detailed examples we will show how to implement and manipulate appropriate data structures for several common types of problems and how to analyze the performance in order to assess algorithmic quality and complexity. We will also suggest ways in which to overcome typical performance problems.

*Mathematica Technology > Kernel > Data Structures

tables, sparse arrays, stacks, queues, trees, bitvectors

Downloads Download Wolfram CDF Player

Lichtblau_Algorithms.nb (85.8 KB) - Mathematica Notebook

Translate this page: