Книга: A Common-Sense Guide to Data Structures and Algorithms in Python, Volume 1
Назад: A Linear Solution
Дальше: Exercises

Wrapping Up

It’s clear that having a solid understanding of Big O notation can enable you to identify slow code and select the faster of two competing algorithms.

However, in some situations Big O notation will have us believe that two algorithms have the same speed, while one is actually faster. In the next chapter, you’re going to learn how to evaluate the efficiencies of various algorithms even when Big O isn’t nuanced enough to do so.

Назад: A Linear Solution
Дальше: Exercises