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:

1. Order of Algorithms
2. Constant Algorithms, O(1)
3. log₂N Algorithms, O(log₂N)
4. Linear Algorithms, O(N)
5. N * log₂N Algorithms, O(N * log₂N)
6. Quadratic Algorithms, (N²)
7. Other Orders
8. Comparison of Orders of Algorithms