Linear
Last updated
What is Linear?
Linear time complexity, denoted as O(n), is one of the best possible algorithmic performance situations. An algorithm is said to have a linear time complexity when the running time increases at most linearly with the size of the input data. This means that if you double the size of the input, the running time will at most double as well. In an ideal situation, every single element in the data set should be viewed exactly once. Sorting algorithms such as counting sort and bucket sort have linear time complexity under certain conditions.
More in stage 6: Algorithmic Complexity
Linear: common questions
Can I learn Linear 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 Linear 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 Linear tutorial for beginners?
It is lesson 34 of 107 in the free Data Structures & Algorithms roadmap, in stage 6, Algorithmic Complexity. If you are new to Data Structures & Algorithms, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.