what is the above note when I see symbols such as N (O) O (n), n (1)-O or O (naugho)
?
what is the above note when I see symbols such as N (O) O (n), n (1)-O or O (naugho)
?
time algorithm complexity, indicating how many operations it takes to get a result.
algorithm is often expressed by big O, which does not represent the specific time, but the number of steps of the operation.
different algorithms have different algorithm complexity. The same problem using different algorithms can produce great differences in running speed.
related documents:
https://github.com/ksco/swift.
python.org/runestone/static/pythonds/AlgorithmAnalysis/BigONotation.html" rel=" nofollow noreferrer "> http://interactivepython.org/.
Previous: The page css introduced by include is invalid?
Next: How to increase the amplitude between each random number
now I want to use the simulator to simulate the relevant companies searched by enterprises. I have a text here that contains some company names. I want to do keyword matching. If it is a company, save it, otherwise delete the company. How do you do t...