|
Two critical criteria used for selecting a data structure and algorithm are the amount of memory required and the speed of execution. The analysis of the speed of an algorithm leads to a summary statement called the order of an algorithm.
The key topics for this lesson are:
- Order of Algorithms
- Constant Algorithms, O(1)
- log2N Algorithms, O(log2N)
- Linear Algorithms, O(N)
- N * log2N Algorithms, O(N * log2N)
- Quadratic Algorithms, (N2)
- Other Orders
- Comparison of Orders of Algorithms
|