<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>polynomial on plaintext</title><link>https://dudung.github.io/plaintext/tags/polynomial/</link><description>Recent content in polynomial on plaintext</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Tue, 26 Dec 2023 19:11:00 +0800</lastBuildDate><atom:link href="https://dudung.github.io/plaintext/tags/polynomial/index.xml" rel="self" type="application/rss+xml"/><item><title>functions for polynomial</title><link>https://dudung.github.io/plaintext/000w/</link><pubDate>Tue, 26 Dec 2023 19:11:00 +0800</pubDate><guid>https://dudung.github.io/plaintext/000w/</guid><description>intro constant coefficents approach 1 approach 2 approach 3 approach 4 approach 5 approach 6 approach 7 variable coefficients challenges refs intro Link to heading When have to work with function representing polynomial, e.g. plot polynomial function, the function can be made by summing all terms manually (Imam, 2018). To calculate $f(x)$ for single value of $x$ there is at least two ways with different time complexity, $O(n^2)$ by adding each term for $x^j$ with multiplication and summation loops, and $O(n)$ by using Horner&amp;rsquo;s method (Taparia, 2022).</description></item></channel></rss>