Big O Notation
Last updated
What is Big O Notation?
The Big O notation can be used to describe how the running time of an algorithm scales with the growth of the input size, ignoring implementation details such as programming language and computer speed. Specifically, it denotes the upper bound of the growth rate of a function that relates the running time of an algorithm to its input size. It can be used to compare algorithms and determine which one is better.
Free resources to learn Big O Notation
More in stage 3: Asymptotic Notation
Big O Notation: common questions
Can I learn Big O Notation in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Big O Notation in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Big O Notation tutorial for beginners?
It is lesson 34 of 188 in the free Computer Science roadmap, in stage 3, Asymptotic Notation. If you are new to Computer Science, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.