# Evaluating the Complexity of Structures Computer Programs (UMAP)

### Author: David Finkel and Gary Haggard

This module presents a mathematical study of the problem of evaluating the complexity of structured computer programs. This material is used to determine a function to describe the complexity of a structured program. Such functions can be used to determine when one algorithm to solve a problem is better than another.** Table of Contents:INTRODUCTIONOVERVIEWDEFINITION OF ASYMPTOTICALLY DOMINATESPROPERTIES OF THE RELATION ASYMPTOTICALLY DOMINATESPOLYNOMIAL FUNCTIONSAPPLICATION TO MORE GENERAL FUNCTIONSBIG-O NOTATIONTHE COMPLEXITY OF AN ALGORITHMTHE COMPLEXITY OF STRUCTURED PROGRAMS** Sequence

Selection

Repetition

**ALGORITHMS FOR DETERMINING IF N IS PRIME**

Algorithm 1

Algorithm 2

Algorithm 3

Algorithm 4

**COMPARING ALGORITHMS**

SUMMARY

SAMPLE EXAM

SOLUTIONS TO EXERCISES

ANSWERS TO SAMPLE EXAM

REFERENCES

ABOUT THE AUTHORS

SUMMARY

SAMPLE EXAM

SOLUTIONS TO EXERCISES

ANSWERS TO SAMPLE EXAM

REFERENCES

ABOUT THE AUTHORS

#### Mathematics Topics:

#### Application Areas:

#### Prerequisites:

You must have a **Full Membership** to download this resource.

If you're already a member, **login here**.