Polynomial

Last updated

What is Polynomial?

Polynomial algorithms are algorithms that have a runtime that is a polynomial function of the input size. This means that the runtime is a function of the form n^k where k is a constant. For example, the runtime of the following algorithm is n^2:

def polynomial_algorithm(n):
    for i in range(n):
        for j in range(n):
            print(i, j)

Free resources to learn Polynomial

More in stage 3: Asymptotic Notation

Polynomial: common questions

Can I learn Polynomial 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 Polynomial 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 Polynomial tutorial for beginners?

It is lesson 31 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.

Still confused? Ask me