Lines Matching full:because

194 It has a complexity of `O(n^3)` because both `e()` and `l()` do.
204 by 0) because that is undefined.
225 But what if the number is negative? We ignore that for now because we eventually
231 (`e(y * l(x))`) and return that result because the result will go to zero
241 a little extra) to the `scale`. Why? Because this will ensure that the next part
247 because now we have the correct `scale`. And we *also* have to calculate the
256 But then we *multiply* it into the integer portion of the power. Why? Because
271 It has a complexity of `O(n)` because of add.
279 It has a complexity of `O(n)` because of add.
287 It has a complexity of `O(n^3)` because of linear amount of `O(n^2)`
296 It has a complexity of `O(n^3)` because of the division and factorials.
304 It has a complexity of `O(n^3)` because of the division and factorials.
310 The algorithm is to use the formula `l(x)/l(b)` with double the `scale` because
314 It has a complexity of `O(n^3)` because of the division and `l()`.
350 It has a complexity of `O(n^4)` because it has a linear number of divisions.
361 It has a complexity of `O(n^4)` because of `gcd()`.
369 It has a complexity of `O(n^3)` because of arctangent.
377 It has a complexity of `O(n^3)` because of sine, cosine, and division.
385 It has a complexity of `O(n^3)` because of arctangent.