Data Structures and Algorithms
with Object-Oriented Design Patterns in C# |

In this section we develop a detailed model of the running time performance of C# programs. The model developed is independent of the underlying hardware and system software. Rather than analyze the performance of a particular, arbitrarily chosen physical machine, we model the execution of a C# program on the ``common language runtime'' (see Figure ).

A direct consequence of this approach is that we lose some fidelity--the resulting model cannot predict accurately the performance of all possible hardware/software systems. On the other hand, the resulting model is still rather complex and rich in detail.

- The Basic Axioms
- A Simple Example-Arithmetic Series Summation
- Array Subscripting Operations
- Another Example-Horner's Rule
- Analyzing Recursive Methods
- Yet Another Example-Finding the Largest Element of an Array
- Average Running Times
- About Harmonic Numbers
- Best-Case and Worst-Case Running Times
- The Last Axiom

Copyright © 2001 by Bruno R. Preiss, P.Eng. All rights reserved.