Asymptotic Notation
Last updated
What is Asymptotic Notation?
The efficiency of an algorithm depends on the amount of time, storage and other resources required to execute the algorithm. The efficiency is measured with the help of asymptotic notations.
An algorithm may not have the same performance for different types of inputs. With the increase in the input size, the performance will change.
The study of change in performance of the algorithm with the change in the order of the input size is defined as asymptotic analysis.
Free resources to learn Asymptotic Notation
More in stage 3: Asymptotic Notation
Asymptotic Notation: common questions
Can I learn Asymptotic 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 Asymptotic 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 Asymptotic Notation tutorial for beginners?
It is lesson 18 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.