## Time and space complexity

- This is generally a function of the input size
- E.g., sorting, multiplication

- How we characterize input size depends:
- Sorting: number of input items
- Multiplication: total number of bits
- Graph algorithms: number of nodes & edges
- Etc

- This is generally a function of the input size

Previous slide | Next slide | Back to first slide | View graphic version |