-
Notifications
You must be signed in to change notification settings - Fork 0
/
quadratic-pseudocode.py
38 lines (32 loc) · 1013 Bytes
/
quadratic-pseudocode.py
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
a = *unknown
b = *unknown
c = *unknown
factors = [] # empty list
i = c-|c|
loop {
# check if number is a factor
# if the remainder (%) of c/i is 0
if(c % i == 0) {
# (current) i is a factor
r = c/i # get the other factor in the pair (i * what == c)
# i * r == c
if(i+r == b) {
# add positive i and r to the list of factors (of c) (that also add up to b)
factors.push(["+ {i}", "+ {r}"])
}else if(-i+r == b) {
# add negative i and r to the list of factors (of c) (that also add up to b)
factors.push(["- {i}", "+ {r}"])
} ... # !!! IMPORTANT: THIS MEANS WE KEEP CHECKING FOR EACH TYPE! (i+r), (-i+r), (i-r), (-i-r)!! # (2 more iterations 4 total)
}
i = i + 1
if(i == |2c|) {
break # end loop
}else {
return # return to start of loop
}
}
first_factors = factors[1] # [a,b]
# first_factors[1] == a
# first_factors[2] == b
answer = `(x { first_factors[1] })(x { first_factors[2] })`
## answer = `(x {factors[1][1]})(x {factors[1][2]})` is also valid