Implemented e^x recursively in xslt 1.0 using power series expansion.
Note that the complexity of the calculation is in O(n) with n as the amount of terms in the power series expansion to be calculated.
-
Notifications
You must be signed in to change notification settings - Fork 0
keksklauer4/XSLT-power-series
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented e^x recursively in xslt 1.0 using power series expansion.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published