E D R , A S I H C RSS

호너의법칙



:
A(x) = (an)Xn+ an-1Xn-1 + ... + a1X + aX

((((an)X + (an-1))X + (an-2))X + ... a1)X + a0
환하 (Horner) .

.

  • , .
  • .
  • A(x) .
  • .

input

 int a[11] = {3,3,3,3,3,3,3,3,3,3,3}
 X   .

output


=====================================================
|index| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
=====================================================
| data| 3 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 3 |  3 |
=====================================================
# Horner Function Value ----> 33
# Horner ADD      Count ----> 10
# Horner Multiply Count ----> 10


C/C++ /
C/C++ /
태훈() C /태훈zyint
java /

...... 해하 ...
. Function Value a(x)?? ( ?)
a[11 an, an-1, n ? 11 ?
??? int ..;;한 ? ? ?
Xn X^n , ..
, { ... ((anX + an-1)X + an-2)x + ... a1 }X + a0 ..;;ㅁ;;
..!@#$%^&*()...........
..-

1 33 10, 10 .... 11 ??
an ?? ..ㅠ.ㅜ -

- ! input , , .
Xn-1 X n-1 . , .

...... -_- --

, 한 n = 1 . n = 2, 3, ... . , . 한 하 . --

, x. output x = 1. output.txt파. . . --

an n -_-;;;........ 태훈zyint

. ! --
----
LittleAOI
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:31:33
Processing time 0.0441 sec