algorithms_complexity/polynomial.py at master · romebell/algorithms_complexity · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
# Polynomial - O(n^2)

def quadratic(n):
    for i in range(1, n):
        for j in range(1, n):
                pass

# Polynomial - O(n^3)
def cubic(n):
    for i in range(1, n):
        for j in range(1, n):
            for k in range(1, n):
                pass

# we have to look for nested loops where both depend on the size of our input

```js
function quadratic(n) {
    for (let i = 1; i <= n; i++) {
        for (let j = 1; j <= n; j++) {
            // something
        }
    }
}
```


# Polynomial - O(n^3)
```js
function cubic(n) {
    for (let i = 1; i <= n; i++) {
            for (let j = 1; j <= n; j++) {
                for (let k = 1; k <= n; k++) {
                    // something
                }
            }
        }
}
```