20.1 Introduction to Algorithms
20.2 Different types of algorithms
20.3 Metrics to measure algorithmic performance
20.4 Learn about the Big-O notation
Algorithm = Method, technique,
paradigm to solve a problem.
Performance
Speed
Space
Accuracy
ANALYSIS OF ALGORITHMS
Measure:
O(n) | 10 100 1E6 |
O(n log n) | ~30 |
O(n2) | 100 1E6 1E12 |
CLASSIFICATION OF ALGORITHMS
TYPES OF ALGORITHMS
PROBLEM:
Given 9 cookies
and 4 paper bags
Required to place an odd number of cookies in each bag.
Note: All cookies to be used
(none eaten!)
1. Simulation
2. Enumeration -
list all cases
3. Theoretical Approach
4. Creative Solution
Many more solutions
ALGORITHM PROGRAMS AND EXAMPLES
There are several program examples for each type of algorithm
discussed in lectures, including output and input files, in FORTRAN
90, PASCAL and C. These are found on:
The disk which accompanies the FORTRAN 90 book
This INTERNET web site - Link to Program selection page
On to the next lecture
Go back to lecture menu