Anonymous user
Horner's rule for polynomial evaluation: Difference between revisions
Horner's rule for polynomial evaluation (view source)
Revision as of 23:12, 5 October 2014
, 9 years ago→{{header|Rust}}: keeping it compiling.
(added swift) |
(→{{header|Rust}}: keeping it compiling.) |
||
Line 1,395:
Works with any number type. It uses a reversed left fold to accumulate the result, similar to the Haskell solution.
<lang Rust>// rust 0.
std::num::zero;
fn horner<T:Num>(cs:&[T], x:T) -> T {
cs.
}
fn main() {
println!("{}", horner([-
}</lang>
| |||