Talk:Polynomial synthetic division: Difference between revisions

 

::::: This is NOT an implementation detail, it's a difference in the algorithm that drastically reduce the number of calculations required to find the solution. The [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] is different, so that asymptotically (ie, when using big polynomials), you will never reach the same performance as Synthetic Division if you use Long Division, no matter how you implement it or the language you use. Avoiding the recursive loop of Long Division is possible, I also did it, but it's a simple loop flattening trick, it doesn't change the computational cost (you will do the same number of calculations and iterations as if you did it recursively). This difference between the two algos is similar to the difference that separates Merge Sort and Quick Sort, and they both have a separate page: the algorithms are different and thus they incur a different computational cost. Of course, the goal is the same, just like those sorting algorithm, so maybe both Polynomial Long Division and Polynomial Synthetic Division should be put under the same subcategory Polynomial Division. --[[User:Lrq3000|Lrq3000]] ([[User talk:Lrq3000|talk]]) 17:28, 3 July 2015 (UTC)