- Algorithms consume resources
- Historical perspective
- Measuring time consumption
- Abstract time
- How do we count the steps?
- Time complexity - Mathematical Concepts
- The Different Measures
- Find Largest Algorithm
- The "Count"
- Sequential search
- Analysis of sequential search

- Order of magnitude
- Asymptotic analysis
- Generalize for all polynomials
- Counting Pseudocode Steps
- A Comparison of Four Orders of Magnitude
- Comparison of Orders of Magnitude
- Pattern matching algorithm
- Binary search
- Binary Search Example
- Binary search algorithm
- Analysis of binary search
- Figure of n and lgn

- Sorting
- Selection Sort
- Example
- Comparing Time Complexities
- The complexity of sorting
- Possibly the WORST Possible Sort Algorithm?
- Hamiltonian circuit
- Brute-Force algorithm
- Exponential Time Complexity
- Comparison of Orders of Magnitude
- Summary: Efficiency and Complexity
- Summary: Hierarchy of Efficiency

Last Updated 2000/12/10

© J.A.N. Lee, 2000