Lines Matching full:division

33 ### Division  subsection in Algorithms
35 This `bc` uses Algorithm D ([long division][2]). Long division is polynomial
36 (`O(n^2)`), but unlike Karatsuba, any division "divide and conquer" algorithm
38 algorithms become less attractive with division as this operation typically
41 While the implementation of long division may appear to use the subtractive
48 1.	Division and subtraction can share code (one of the less important goals of
52 Using multiplication would make division have the even worse algorithmic
67 Its complexity is `O(log(n)*n^2)` as it requires one division per iteration, and
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.
314 It has a complexity of `O(n^3)` because of the division and `l()`.
335 Like square root, its complexity is `O(log(n)*n^2)` as it requires one division
377 It has a complexity of `O(n^3)` because of sine, cosine, and division.