Update time_complexity.md

Update first paragraph to avoid confusion between time complexity and run time
This commit is contained in:
Enlightenus 2024-07-24 19:40:11 -07:00 committed by GitHub
parent 2758e06374
commit 8ccab7f254
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194

View File

@ -1,6 +1,6 @@
# Time complexity
Time complexity is a concept used to measure how the run time of an algorithm increases with the size of the input data. Understanding time complexity is crucial for accurately assessing the efficiency of an algorithm.
We can directly and accurately assess the efficiency an algorithm by measuring the run time. How to accurately assess the run time of an algorithm?
1. **Determining the Running Platform**: This includes hardware configuration, programming language, system environment, etc., all of which can affect the efficiency of code execution.
2. **Evaluating the Run Time for Various Computational Operations**: For instance, an addition operation `+` might take 1 ns, a multiplication operation `*` might take 10 ns, a print operation `print()` might take 5 ns, etc.