we know a formula that... «Грокаем структуры данных»

  • Аватар пользователя
    fru-n-quiz
    14 марта 2026
    we know a formula that describes the asymptotic behavior of an algorithm, we can understand its order of magnitude, an estimate of the time it will take for inputs of various sizes (not the exact time it will take to run, but an idea of whether it will take milliseconds, seconds, or even years!).
    like2 понравилось
    7