Logarithms vs Exponentials: The Simple Idea Behind O(log n) and O(2ⁿ)
This story is from 2026-09-16. It is preserved in the archive; the latest stories are on the live feed.
When learning DSA and Big-O, two mathematical concepts appear again and again: Logarithms and exponentials . They may sound complicated, but the basic idea is actually simple: Logarithm asks: “How many times can I divide?” Exponential asks: “How many times can I multiply?” Once you understand this,…
Read the full story at DEV Community — AI ↗
Timeline · 1 report
- 2026-09-16 02:50 · DEV Community — AI
Logarithms vs Exponentials: The Simple Idea Behind O(log n) and O(2ⁿ)
More stories
- AI's role in building AI surging? Anthropic says Claude now leads 26% of its R&D — Mint AI
- Google Joins OpenAI, Anthropic, Meta in Disclosing AI Hacks — Bloomberg AI
- Anthropic, OpenAI, SpaceXAI, Google sued over call to ‘pace’ AI development — Politico Technology
- Alibaba ships Qwen3.8-Omni-Flash to watch, listen and call tools — r/LocalLLM
- Introducing Kimi K3 on Amazon Bedrock — AWS Machine Learning Blog
- Optimizing agent system prompts with Amazon Bedrock AgentCore — AWS Machine Learning Blog
- Introducing Amazon SageMaker HyperPod Inference Gateway — AWS Machine Learning Blog
- Introducing Astra for Law — OpenAI News
Get the daily brief of stories like this at 6:30 every morning →