maladroit.dev
Posts Notes About

Logarithmic time functions

algorithms

Logarithmic time functions

f(n)=log(n)

Logarithmic functions grow very slowly as n gets large, but not as slow as Constant-functions

References

  • The-Algorithm-Design-Manual
email rss github bluesky

2024-2026 maladroit.dev