'How to find complexity with polynomial

Given a function H(n) which requires 2n units of time to be executed.

a) Find the complexity T(n) of the Python code segment below, where n is the size of the input data. Show your result in polynomial from and clearly show your step.

b) What is its Big-O representation based on the properities of Big-O? Name the related property of Big-O applied in this case.

for i in range(n):
    H(n)
    for j in range(n)
        for k in range(j + 1)
            H(n)

Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution	Source

'How to find complexity with polynomial

Sources

Related Questions