Rosetta Code

Averages/Pythagorean means: Difference between revisions

Page Discussion

Averages/Pythagorean means (view source)

Revision as of 07:53, 22 February 2021

277 bytes removed ,  3 years ago
m
→‎{{header|REXX}}: added/changed whitespace and comments, used a template for the output sections.
(→‎{{header|Kotlin}}: kotlin/js compatability, harmonic mean: reduce to fold since first element is not divided)
m (→‎{{header|REXX}}: added/changed whitespace and comments, used a template for the output sections.)
Line 2,817:
numeric digits 20 /*use a little extra for the precision.*/
parse arg n . /*obtain the optional argument from CL.*/
if n=='' | n=="," then n=10 10 /*None specified? Then use the default*/
sum= 0; prod= 1; rSum=0 0 /*initialize sum/product/reciprocal sum*/
$=; do #=1 for n; $= $ # /*generate list by appending # to list.*/
sum = sum + # /*compute the sum of all the elements. */
prod= prod * # /*compute the product of all elements. */
rSum= rSum + 1/# /*compute the sum of the reciprocals. */
end /*#*/
say ' list ='$ /*display the list of numbers used. */
say 'Amean =' sum / n /*calculate & display arithmetic mean.*/
say 'Gmean =' Iroot(prod, n) /* " " " geometric " */
IrootErr:if result=="[n/a]" then say '***error*** (from Iroot): root' y "can't be even if 1st argument is < 0."▼
say 'Hmean =' n / rSum /* " " " harmonic " */
exit 0 /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
Iroot: procedure; parse arg x 1 ox, y 1 oy /*get both args, and also a copy of X&Y*/
if x=0 | x=1 | y=1 then return x /*handle special case of zero and unity*/
if y=0 if y=0 then return 1 then return 1 /* " " " " a zero root.*/
if x<0 & y//2==0 then return IrootErr() '[n/a]' /*indicate result is "not applicable". */
x= abs(x); y= abs(y); m= y - 1 /*use the absolute value for X and Y. */
oDigs= digits(); a= oDigs + 5 /*save original digits; add five digs.*/
g= (x+1) / y**y 2 /*use this as the first guesstimate. */
d=5 d= 5 /*start with 5 dec digs, saves CPU time*/
do until d==a do until d==a; d= min(d + d, a) /*keep going as digits are increased. */
d=min(d+d, a); numeric digits d; f= d - 2 /*limit digits to original digits + 5.*/
og= og= /*use a non-guessnon─guess for the old G (guess)*/
do forever; gm=g**m do forever; gm= g**m /*keep computing at the Yth root. */
_= format( (m*g*gm + x) / (y*gm), , f) /*this is the nitty─gritty calculation.*/
if _=g | _=og then leave /*are we close enough yet? */
og=g; g=_ og= g; g= _ /*save guess ──► OG; set the new guess.*/
end /*forever*/
end end /*until */
 
if oy<0 then g=1/g g= g * sign(ox); if oy<0 then g= 1 / g /*use reciprocal whenadjust for Yoriginal X issign; negativeneg. root*/
numeric digits oDigs; return sign(ox)* g / 1 /*normalize to original decimal digits.*/</lang>
'''{{out|output''' |text=&nbsp; when using the default inputsinput:}}▼
/*──────────────────────────────────────────────────────────────────────────────────────*/
▲IrootErr: say '***error*** (from Iroot): root' y "can't be even if 1st argument is < 0."
return '[n/a]' /*return a "not applicable" string. */</lang>
▲'''output''' &nbsp; using the default inputs:
<pre>
list = 1 2 3 4 5 6 7 8 9 10
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/140086"