Defining the data structures is a big part of desing a program. Once that is laid out, and if laid out well, the code will start fitting itself and the algorithms will be fairly obvious.
In this chapter we will implement the Markov Chain Algorithm in a variaty of languages, to assess the differences and similarities between each of them.
- 3.1 The Markov Chain Algorithm
- 3.2 Data Structure Alternatives
- 3.3 Building the Data Structure in C
- 3.4 Generating Output
- 3.5 Java
- 3.6 C++
- 3.7 Awk and Perl
- 3.8 Performance
- 3.9 Lessons
- Generic Programming and the STL by Matthew Austern
- The C++ Programming Language by Bjarne Stroustrup
- The Java Programming Language by Ken Arnold and James Gosling
- Programming Perl by Larry Wall, Tom Christansen and Randal Schwartz
- Design Patterns: Elements of Reusable Object-Oriented Software by Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides
- Computer Recreations, Scientific American Magazine (article)