Chapter 11 Intermediate Programming--Data and Techniques


11.0 Chapter Goals
11.1 Introduction

Part A--Programming Techniques

11.2 Recursion Revisited
     11.2.1 The Knight's Tour--An Extended Example
11.3 Selection Revisited–The CASE Statement
11.4 Pragmas
11.5 Efficiency in Large Programs
     11.5.1 Controlling Run-Time Checking
     11.5.2 Compiling For Specified Environments
     11.5.3 Fine Tuning Loops
     11.5.4 Linking, Program Libraries and Speed
     11.5.5 Efficiency--A Summary

Part B--Intermediate (Structured) Data Issues

11.6 Structure Constructors
     11.6.1 Array Constructors
     11.6.2 Record Constructors
11.7 The Variant Record--a Chameleon
11.8 An Extended Example--Variant Records
11.9 Chapter Summary
11.10 Assignments
Contents