You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
---
|
|
|
|
|
comments: true
|
|
|
|
|
icon: material/timer-sand
|
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
# Chapter 2. Complexity analysis
|
|
|
|
|
|
|
|
|
|
{ class="cover-image" }
|
|
|
|
|
|
|
|
|
|
!!! abstract
|
|
|
|
|
|
|
|
|
|
Complexity analysis is like a space-time navigator in the vast universe of algorithms.
|
|
|
|
|
|
|
|
|
|
It guides us in exploring deeper within the the dimensions of time and space, seeking more elegant solutions.
|
|
|
|
|
|
|
|
|
|
## Chapter contents
|
|
|
|
|
|
|
|
|
|
- [2.1 Algorithm efficiency assessment](performance_evaluation.md)
|
|
|
|
|
- [2.2 Iteration and recursion](iteration_and_recursion.md)
|
|
|
|
|
- [2.3 Time complexity](time_complexity.md)
|
|
|
|
|
- [2.4 Space complexity](space_complexity.md)
|
|
|
|
|
- [2.5 Summary](summary.md)
|
