Averages/Arithmetic mean: Difference between revisions
→{{header|langur}}
(Add Red) |
Langurmonkey (talk | contribs) |
||
(40 intermediate revisions by 23 users not shown) | |||
Line 1:
{{task|Probability and statistics}}
;Task
Write a program to find the [[wp:arithmetic mean|mean]] (arithmetic average) of a numeric vector.
Line 14:
=={{header|0815}}==
<
{x{+=<:2:x/%<:d:~$<:01:~><:02:~><:03:~><:04:~><:05:~><:06:~><:07:~><:08:
~><:09:~><:0a:~><:0b:~><:0c:~><:0d:~><:0e:~><:0f:~><:10:~><:11:~><:12:~>
<:13:~><:14:~><:15:~><:16:~><:17:~><:18:~><:19:~><:ffffffffffffffff:~>{x
{+>}:8f:{&={+>{~>&=x<:ffffffffffffffff:/#:8f:{{=<:19:x/%
</syntaxhighlight>
{{out}}
<pre>
Line 28:
=={{header|11l}}==
{{trans|Python}}
<
R sum(x) / Float(x.len)
print(average([0, 0, 3, 1, 4, 1, 5, 9, 0, 0]))</
{{out}}
<pre>
Line 39:
=={{header|360 Assembly}}==
Compact and functional.
<
USING AVGP,12
LR 12,15
Line 65:
Z DC CL80' '
U DS CL2
END AVGP</
{{out}}
<pre> 5.50</pre>
Line 72:
Called as a subroutine (i.e., JSR ArithmeticMean), this calculates the integer average of up to 255 8-bit unsigned integers. The address of the beginning of the list of integers is in the memory location ArrayPtr and the number of integers is in the memory location NumberInts. The arithmetic mean is returned in the memory location ArithMean.
<
TYA
PHA ;push accumulator and Y register onto stack
Line 111:
TAY
PLA
RTS ;return from routine</
=={{header|8th}}==
<
: avg \ a -- avg(a)
dup ' n:+ 0 a:reduce
Line 124:
[ 10 ] avg . cr
bye
</syntaxhighlight>
Output is:<br>
2.54395<br>
Line 131:
=={{header|ACL2}}==
<
(if (endp xs)
(mv 0 0)
Line 143:
(mv-let (n d)
(mean-r xs)
(/ n d))))</
=={{header|Action!}}==
{{libheader|Action! Tool Kit}}
<syntaxhighlight lang="action!">INCLUDE "D2:REAL.ACT" ;from the Action! Tool Kit
PROC Mean(INT ARRAY a INT count REAL POINTER result)
INT i
REAL x,sum,tmp
IntToReal(0,sum)
FOR i=0 TO count-1
DO
IntToReal(a(i),x)
RealAdd(sum,x,tmp)
RealAssign(tmp,sum)
OD
IntToReal(count,tmp)
RealDiv(sum,tmp,result)
RETURN
PROC Test(INT ARRAY a INT count)
INT i
REAL result
Mean(a,count,result)
Print("mean(")
FOR i=0 TO count-1
DO
PrintI(a(i))
IF i<count-1 THEN
Put(',)
FI
OD
Print(")=")
PrintRE(result)
RETURN
PROC Main()
INT ARRAY a1=[1 2 3 4 5 6]
INT ARRAY a2=[1 10 100 1000 10000]
INT ARRAY a3=[9]
Put(125) PutE() ;clear screen
Test(a1,6)
Test(a2,5)
Test(a3,1)
Test(a3,0)
RETURN</syntaxhighlight>
{{out}}
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Arithmetic_mean.png Screenshot from Atari 8-bit computer]
<pre>
mean(1,2,3,4,5,6)=3.5
mean(1,10,100,1000,10000)=2222.2
mean(9)=9
mean()=0
</pre>
=={{header|ActionScript}}==
<
{
var sum:Number = 0;
Line 152 ⟶ 208:
sum += vector[i];
return vector.length == 0 ? 0 : sum / vector.length;
}</
=={{header|Ada}}==
This example shows how to pass a zero length vector as well as a larger vector. With Ada 2012 it is possible to check that pre conditions are satisfied (otherwise an exception is thrown). So we check that the length is not zero.
<
with Ada.Text_IO; use Ada.Text_IO;
Line 177 ⟶ 233:
Put(Item => Mean(A (1..0)), Fore => 1, Exp => 0);
New_Line;
end Mean_Main;</
Output:
3.83333
Line 184 ⟶ 240:
=={{header|Aime}}==
<
mean(list l)
{
Line 203 ⟶ 259:
0;
}</
=={{header|ALGOL 68}}==
Line 211 ⟶ 267:
{{works with|ALGOL 68G|Any - tested with release mk15-0.8b.fc9.i386}}
{{works with|ELLA ALGOL 68|Any (with appropriate job cards) - tested with release 1.8.8d.fc9.i386 - note that some necessary LONG REAL operators are missing from ELLA's library.}}
<
# Calculates the mean of qty REALs beginning at p. #
IF LWB p > UPB p THEN 0.0
Line 223 ⟶ 279:
[6]REAL test := (1.0, 2.0, 5.0, -5.0, 9.5, 3.14159);
print((mean(test),new line))
)</
=={{header|ALGOL W}}==
<
% procedure to find the mean of the elements of a vector. %
% As the procedure can't find the bounds of the array for itself, %
Line 247 ⟶ 303:
r_format := "A"; r_w := 10; r_d := 2; % set fixed point output %
write( mean( numbers, 1, 5 ) );
end.</
=={{header|AmigaE}}==
Because of the way Amiga E handles floating point numbers, the passed list/vector must contain
all explicitly floating point values (e.g., you need to write "1.0", not "1")
<
DEF m, i, ll
ll := ListLen(l)
Line 265 ⟶ 321:
WriteF('mean \s\n',
RealF(s,mean([1.0, 2.0, 3.0, 4.0, 5.0]), 2))
ENDPROC</
=={{header|AntLang}}==
AntLang has a built-in avg function.
<syntaxhighlight lang
=={{header|APL}}==
{{works with|APL2}}
<syntaxhighlight lang="apl">
X←3 1 4 1 5 9
(+/X)÷⍴X
3.833333333
</syntaxhighlight>
{{works with|Dyalog APL}}
A proper function definition:
<syntaxhighlight lang="apl">
Avg←{(+⌿⍵)÷≢⍵}
Avg 1 2 3 4 5 6
3.5
</syntaxhighlight>
Using [[tacit programming]]:
<syntaxhighlight lang="apl">
Avg← +⌿÷≢
Avg 1 2 3 4 5 6
3.5
</syntaxhighlight>
'''N.B.:''' the symbol for [https://aplwiki.com/wiki/Tally Tally (≢)] doesn't display correctly on Chrome-based browsers at the moment.
=={{header|AppleScript}}==
Line 282 ⟶ 356:
With vanilla AppleScript, the process is the literal one of adding the numbers and dividing by the list length. It naturally returns results of class real, but it would be simple to return integer-representable results as integers if required.
<
set len to (count listOfNumbers)
if (len is 0) then return missing value
Line 294 ⟶ 368:
end average
average({2500, 2700, 2400, 2300, 2550, 2650, 2750, 2450, 2600, 2400})</
{{output}}
Line 303 ⟶ 377:
The vanilla method above is the more efficient with lists of up to around 100 numbers. But for longer lists, using Foundation methods with AppleScriptObjectC can be useful
<
use framework "Foundation"
Line 313 ⟶ 387:
end average
average({2500, 2700, 2400, 2300, 2550, 2650, 2750, 2450, 2600, 2400})</
{{output}}
Line 319 ⟶ 393:
=={{header|Applesoft BASIC}}==
<
0 READ V$
1 IF LEN(V$) = 0 THEN END
Line 336 ⟶ 410:
A(0) = 5 : A(1) = 1 : A(2) = 2 : A(3) = 2.718 : A(4) = 3 : A(5) = 3.142
N = A(0) : IF N THEN S = 0 : FOR I = 1 TO N : S = S + A(I) : NEXT : ? S / N
</syntaxhighlight>
=={{header|Arturo}}==
<
print average arr</
{{out}}
Line 349 ⟶ 423:
=={{header|Astro}}==
<
mean(1..10)
mean([])
</syntaxhighlight>
=={{header|AutoHotkey}}==
<
Loop, % i {
Random, v, -3.141592, 3.141592
Line 361 ⟶ 435:
sum += v
}
MsgBox, % i ? list "`nmean: " sum/i:0</
=={{header|AWK}}==
<
#!/usr/local/bin/gawk -f
Line 388 ⟶ 462:
print mean(nothing)
}
</syntaxhighlight>
{{out}}
Line 399 ⟶ 473:
=={{header|Babel}}==
<
{{Out}}
Line 408 ⟶ 482:
Assume the numbers are in an array named "nums".
<
sum = 0;
FOR i = LBOUND(nums) TO UBOUND(nums)
Line 419 ⟶ 493:
ELSE
PRINT 0
END IF</
==={{header|BBC BASIC}}===
Line 425 ⟶ 499:
To calculate the mean of an array:
<syntaxhighlight lang="bbc basic">
REM specific functions for the array/vector types
Line 454 ⟶ 528:
DEF FN_Mean_Arithmetic#(n#())
= SUM(n#()) / (DIM(n#(),1)+1)
</syntaxhighlight>
[[User:MichaelHutton|Michael Hutton]] 14:02, 29 May 2011 (UTC)
==={{header|IS-BASIC}}===
<
110 LET ARR(3)=3:LET ARR(4)=1:LET ARR(5)=4:LET ARR(6)=1:LET ARR(7)=5:LET ARR(8)=9
120 PRINT AM(ARR)
Line 467 ⟶ 541:
170 NEXT
180 LET AM=T/SIZE(A)
190 END DEF</
=={{header|bc}}==
Uses the current scale for calculating the mean.
<
auto i, s
Line 478 ⟶ 552:
}
return(s / n)
}</
=={{header|Befunge}}==
The first input is the length of the vector. If a length of 0 is entered, the result is equal to <code>0/0</code>.
<
@./\$_\&+\^</
=={{header|blz}}==
<
:mean(vec)
vec.fold_left(0, (x, y -> x + y)) / vec.length()
end</
=={{header|Bracmat}}==
Here are two solutions. The first uses a while loop, the second scans the input by backtracking.
<
(mean1=
sum length n
Line 518 ⟶ 592:
| !sum*!length^-1
);
</syntaxhighlight>
To test with a list of all numbers 1 .. 999999:
<
( :?test
& 1000000:?Length
Line 526 ⟶ 600:
& out$mean1$!test
& out$mean2$!test
)</
=={{header|Brat}}==
<
true? list.empty?, 0, { list.reduce(0, :+) / list.length }
}
p mean 1.to 10 #Prints 5.5</
=={{header|Burlesque}}==
<
blsq ) {1 2 2.718 3 3.142}av
2.372
blsq ) {}av
NaN
</syntaxhighlight>
=={{header|BQN}}==
Defines a tacit Avg function which works on any simple numeric list.
<
Avg 1‿2‿3‿4</
<syntaxhighlight lang="text">2.5</
[https://mlochbaum.github.io/BQN/try.html#code=QXZnIOKGkCArwrTDt+KJoAoKQXZnIDHigL8y4oC/M+KAvzQ= Try It!]
Line 557 ⟶ 631:
Compute mean of a <code>double</code> array of given length. If length is zero, does whatever <code>0.0/0</code> does (usually means returning <code>NaN</code>).
<
double mean(double *v, int len)
Line 580 ⟶ 654:
return 0;
}</
mean[1, 2, 2.718, 3, 3.142] = 2.372
mean[1, 2, 2.718, 3] = 2.1795
Line 589 ⟶ 663:
</pre>
=={{header|C sharp|C#}}==
<
using System.Linq;
Line 599 ⟶ 673:
Console.WriteLine(new[] { 1, 2, 3 }.Average());
}
}</
Alternative version (not using the built-in function):
<
class Program
Line 630 ⟶ 704:
return d / nums.Length;
}
}</
=={{header|C++}}==
{{libheader|STL}}
<
double mean(const std::vector<double>& numbers)
Line 645 ⟶ 719:
sum += *i;
return sum / numbers.size();
}</
Shorter (and more idiomatic) version:
<
#include <algorithm>
Line 657 ⟶ 731:
return 0;
return std::accumulate(numbers.begin(), numbers.end(), 0.0) / numbers.size();
}</
Idiomatic version templated on any kind of iterator:
<
#include <algorithm>
Line 670 ⟶ 744:
return 0;
return std::accumulate(begin, end, 0.0) / std::distance(begin, end);
}</
=={{header|Chef}}==
<
Chef has no way to detect EOF, so rather than interpreting
Line 704 ⟶ 778:
Pour contents of mixing bowl into baking dish.
Serves 1.</
=={{header|Clojure}}==
Returns a [http://clojure.org/data_structures ratio]:
<
(if (empty? sq)
0
(/ (reduce + sq) (count sq))))</
Returns a float:
<
(if (empty? sq)
0
(float (/ (reduce + sq) (count sq)))))</
=={{header|COBOL}}==
Intrinsic function:
<
Sample implementation:
<
PROGRAM-ID. find-mean.
Line 752 ⟶ 826:
GOBACK
.</
=={{header|Cobra}}==
<
class Rosetta
def mean(ns as List<of number>) as number
Line 770 ⟶ 844:
print "mean of [[]] is [.mean(List<of number>())]"
print "mean of [[1,2,3,4]] is [.mean([1.0,2.0,3.0,4.0])]"
</syntaxhighlight>
Output:
Line 779 ⟶ 853:
=={{header|CoffeeScript}}==
<
mean = (array) ->
return 0 if array.length is 0
Line 787 ⟶ 861:
alert mean [1]
</syntaxhighlight>
=={{header|Common Lisp}}==
'''With Reduce'''
<
(
(/ (reduce #'+ sequence) (length sequence))))</syntaxhighlight>
'''With Loop'''
<
(
(/ (loop for i in list sum i)
(length list))))</
=={{header|Craft Basic}}==
<syntaxhighlight lang="basic">dim a[3, 1, 4, 1, 5, 9]
arraysize s, a
for i = 0 to s - 1
let t = t + a[i]
next i
print t / s</syntaxhighlight>
{{out| Output}}<pre>3.83</pre>
=={{header|Crystal}}==
<
def mean(arr) : Float64
arr.sum / arr.size.to_f
end</
=={{header|D}}==
===Imperative Version===
<
real sum = 0.0;
int count;
Line 833 ⟶ 920:
data = [3, 1, 4, 1, 5, 9];
writeln("Mean: ", data.mean);
}</
{{out}}
<pre>mean: 0
mean: 3.83333</pre>
===More Functional Version===
<
real mean(Range)(Range r) pure nothrow @nogc {
Line 847 ⟶ 934:
writeln("Mean: ", (int[]).init.mean);
writeln("Mean: ", [3, 1, 4, 1, 5, 9].mean);
}</
{{out}}
<pre>Mean: 0
Line 854 ⟶ 941:
===More Precise Version===
A (naive?) version that tries to minimize precision loss (but already the sum algorithm applied to a random access range of floating point values uses a more precise summing strategy):
<
CommonType!(T, real) mean(T)(T[] n ...) if (isNumeric!T) {
Line 867 ⟶ 954:
writefln("%8.5f", mean( 0, 3, 1, 4, 1, 5, 9, 0));
writefln("%8.5f", mean([-1e20, 3, 1, 4, 1, 5, 9, 1e20]));
}</
{{out}}
<pre> 0.00000
Line 874 ⟶ 961:
=={{header|Dart}}==
<
void main(){
print(mean([1,2,3,4,5,6,7]));
}</
{{out}}
<pre>4.0</pre>
Line 885 ⟶ 972:
This is not a translation of the bc solution. Array handling would add some complexity. This one-liner is similar to the K solution.
<
3.6</
An expanded example, identifying an empty sample set, could be created as a file, e.g., amean.cd:
<
zd0=qsn [stack length = n]sz
1k [precision can be altered]sz
[+z1<+]ds+x[Sum: ]Pp
ln/[Mean: ]Pp
[Sample size: ]Plnp</
By saving the sample set "1 2 3 5 7" in a file (sample.dc), the routine, listing summary information, could be called in a command line:
<
Sum: 18
Mean: 3.6
Sample size: 5
$</
=={{header|Delphi}}==
<
{$APPTYPE CONSOLE}
Line 927 ⟶ 1,014:
Writeln(Mean(TDoubleDynArray.Create()));
Writeln(Mean(TDoubleDynArray.Create(1,2,3,4,5)));
end.</
=={{header|Dyalect}}==
<
var acc = .0
var len = 0
Line 941 ⟶ 1,028:
}
avg(1, 2, 3, 4, 5, 6)</
=={{header|E}}==
Line 947 ⟶ 1,034:
Slightly generalized to support any object that allows iteration.
<
var count := 0
var sum := 0
Line 955 ⟶ 1,042:
}
return sum / 1.max(count)
}</
=={{header|EasyLang}}==
<syntaxhighlight lang="text">
proc mean . f[] r .
for
s += f[i]
.
r = s / len f[]
.
f[] = [ 1 2 3 4 5 6 7 8 ]
print r
</syntaxhighlight>
=={{header|EchoLisp}}==
'''(mean values)''' is included in math.lib. values may be a list, vector, sequence, or any kind of procrastinator.
<
(lib 'math)
(mean '(1 2 3 4)) ;; mean of a list
Line 992 ⟶ 1,081:
😁 warning: mean : zero-divide : empty-sequence
→ 0
</syntaxhighlight>
=={{header|ECL}}==
<
AveVal(SET OF INTEGER s) := AVE(s);
Line 1,002 ⟶ 1,091:
SetVals := [14,9,16,20,91];
AveVal(SetVals) //returns 30.0 ;
</syntaxhighlight>
=={{header|EDSAC order code}}==
Extends the RC task by finding the arithmetic mean for each of several data sets. Each data set is preceded by the number of data. A count of 0 is not an error but signals that there are no more data sets.
The program needs to avoid the possibility of arithmetic overflow, as pointed out in the F# solution. The moving average used there is not well-suited to EDSAC, on which division had to be done by calling a subroutine. After reading the number of data N, and leaving the trivial case N = 1 for separate treatment, the program first calculates 1/N, then multiplies each value by 1/N before adding it into the result.
<syntaxhighlight lang="edsac">
[Averages/Arithmetic mean - Rosetta Code]
[EDSAC program (Initial Orders 2) to find and print the average of
a sequence of 35-bit fractional values.
Values are read from tape, preceded by an integer count.]
[Library subroutine M3, runs at load time and is then overwritten.
Prints header; here, last character sets teleprinter to figures.]
PF GK IF AF RD LF UF OF E@ A6F G@ E8F EZ PF
*!!!!!COUNT!!!!!!AVERAGE@&#.. [PZ]
[Main routine: must be at even address]
T214K GK
[0] PF PF [average value]
[2] PF PF [reciprocal of data count]
[4] PF [data count]
[5] PD [17-bit constant 1; also serves as '0' for printing]
[6] @F [carriage return]
[7] &F [line feed]
[8] !F [space]
[9] MF [dot (in figures mode)]
[10] K4096F [teleprinter null]
[Entry and outer loop]
[11] A11@
G56F [call library subroutine R4, sets 0D := data count N]
SD E64@ [exit if N = 0]
T4F [clear acc]
AF T4@ [load and save N (assumed < 2^16)]
[18] A18@ G156F [print N (clears acc)]
TD [clear whole of 0D, including sandwich bit]
T4D [same for 4D]
A4@ S2F [acc := N - 2]
G66@ [jump to special action if N = 1]
A2F [restore N after test]
T5F [store N in 4D high word]
A5@ T1F [store 1 in 0D high word]
[29] A29@ G120F [call library subroutine D6, sets 0D := 0D/4D]
AD T2#@ [load and save 1/N]
T#@ [clear average]
S4@ [load -N]
[Inner loop]
[35] T4@ [update negative loop counter]
[36] A36@ G78F [read next datum to 0D (clears acc)]
H2#@ [mult reg := 1/N]
VD [acc := datum/N]
A#@ T#@ [add into average]
A4@ A5@ [increment negative loop counter]
G35@ [loop until counter = 0]
[45] O8@ O8@ [print 2 spaces]
[Print the average value.
NB: Library subroutine P1 requires non-negative input and prints only the
digits after the decimal point. Formatting has to be done by the caller.]
[47] A#@ [load average (order also serves as minus sign)]
G52@ [jump if average < 0]
TD [pass average to subroutine P1]
O65@ [print plus sign (or could be space)]
E56@ [join common code]
[52] TD [average < 0; clear acc]
S#@ TD [pass abs(average) to subroutine P1]
O47@ [print minus sign]
[56] O5@ O9@ [common code: print '0.']
[58] A58@ G192F [call P1 to print abs(average)]
P8F [8 decimal places]
O6@ O7@ [print CR, LF]
E11@ [loop back always (because acc = 0)]
[Jump to here if data count = 0, means end of data]
[64] O10@ [print null to flush teleprinter buffer]
[65] ZF [halt the machine (order also serves as plus sign)]
[Jump to here if data count = 1]
[66] TF [clear acc]
[67] A67@ G78F [read datum to 0D]
AD T#@ [average := datum]
E45@ [jump to print the average]
[The following puts the entry address into location 50,
so that it can be accessed via the X parameter (see end of program).
This is done in case the data is input from a separate tape.]
T50K P11@ T11Z
[Library subroutine R4.
Input of one signed integer, returned in 0D.]
T56K
GKA3FT21@T4DH6@E11@P5DJFT6FVDL4FA4DTDI4FA4FS5@G7@S5@G20@SDTDT6FEF
[Library subroutine R3.
Input of one long signed decimal fraction, returned in 0D.]
T78K
GKT45KP26@TZA3FTHTDT4DA6HT9@H1HS4HT6FIFAFS4HE7HT7FV4DL8FADT4DA6FA5HG8@
H2#HN4DLDYFTDT28#ZPFT27ZTFP610D@524DP5DPDIFS4HG37@S4DT4DT7FA1HT9@E18@
[Library subroutine D6 - Division, accurate, fast.
36 locations, workspace 6D and 8D.
0D := 0D/4D, where 4D <> 0, -1.]
T120K
GKA3FT34@S4DE13@T4DSDTDE2@T4DADLDTDA4DLDE8@RDU4DLDA35@
T6DE25@U8DN8DA6DT6DH6DS6DN4DA4DYFG21@SDVDTDEFW1526D
[Library subroutine P7: print strictly positive integer in 0D.]
T156K
GKA3FT26@H28#@NDYFLDT4DS27@TFH8@S8@T1FV4DAFG31@SFLDUFOFFFSF
L4FT4DA1FA27@G11@T28#ZPFT27ZP1024FP610D@524D!FO30@SFL8FE22@
[Library subroutine P1: print non-negative fraction in 0D, without '0.']
T192K
GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F
[==========================================================================
On the original EDSAC, the following (without the whitespace and comments)
might have been input on a separate tape.]
E25K TX GK
EZ [define entry point]
PF [acc = 0 on entry]
[Counts and data values to be read by library subroutines R3 and R4 respectively.
Note (1) Sign comes *after* value (2) In the data, leading '0.' is omitted.]
7+ 1-2-3-4-5+2-3-
1+ 987654321+
9+ 01+04+09+16+25+36+49+64+81+
9+ 01-04+09-16+25-36+49-64+81-
[Daily minimum temperature (unit = 10 deg. C), Cambridge, UK, January 2000]
31+ 34+14+49+00+04+48+05+48+23-35-07-75+19+03+
26+27+17-06-52+22-17+18+15+03-33-11-04-01-44+89+95+
0+
</syntaxhighlight>
{{out}}
<pre>
COUNT AVERAGE
7 -0.14285714
1 +0.98765432
9 +0.31666666
9 -0.05000000
31 +0.16774193
</pre>
=={{header|Elena}}==
ELENA
<
extension op
Line 1,019 ⟶ 1,248:
while (enumerator.next())
{
sum += *enumerator
count += 1;
};
Line 1,033 ⟶ 1,262:
"Arithmetic mean of {",array.asEnumerable(),"} is ",
array.average()).readChar()
}</
{{out}}
<pre>
Line 1,040 ⟶ 1,269:
=={{header|Elixir}}==
<
def mean(list), do: Enum.sum(list) / length(list)
end</
=={{header|Emacs Lisp}}==
<syntaxhighlight lang
{{libheader|Calc}}
<
=={{header|EMal}}==
<syntaxhighlight lang="emal">
fun mean = real by some real values
real sum
int count
for each real value in values
sum += value
++count
end
return when(count == 0, 0.0, sum / count)
end
writeLine(mean())
writeLine(mean(3,1,4,1,5,9))
</syntaxhighlight>
{{out}}
<pre>
0.0
3.8333333333333333333333333333
</pre>
=={{header|Erlang}}==
<
mean(L) -> lists:sum(L)/erlang:length(L).</
=={{header|Euphoria}}==
<
atom sum
if length(s) = 0 then
Line 1,074 ⟶ 1,323:
sequence test
test = {1.0, 2.0, 5.0, -5.0, 9.5, 3.14159}
? mean(test)</
=={{header|Excel}}==
Assuming the values are entered in the A column, type into any cell which will not be part of the list:
<
Assuming 10 values will be entered, alternatively, you can just type:
<
and then select the start and end cells, not necessarily in the same row or column.
Line 1,104 ⟶ 1,353:
=={{header|F_Sharp|F#}}==
The following computes the running mean using a tail-recursive approach. If we just sum all the values then divide by the number of values then we will suffer from overflow problems for large lists. See [[wp:Moving_average|wikipedia]] about the moving average computation.
<
a + (1. / ((float n) + 1.)) * (v - a)
let mean_series list =
let a, _ = List.fold_left (fun (a, n) h -> avg a (float h) n, n + 1) (0., 0) list in
a</
Checking this:
<
val it : float = 10.86666667
> mean_series [] ;;
val it : float = 0.0</
We can also make do with the built-in ''List.average'' function:
<
=={{header|Factor}}==
<
: arithmetic-mean ( seq -- n )
[ 0 ] [ mean ] if-empty ;</
Tests:
<
3.333333333333333</
=={{header|Fantom}}==
<
class Main
{
Line 1,152 ⟶ 1,401:
}
}
</syntaxhighlight>
=={{header|Fish}}==
<
v< +<>0n; >n;
>l1)?^&,n;</
Must be called with the values pre-populated on the stack, which can be done in the <tt>fish.py</tt> interpreter with the <tt>-v</tt> switch:
<pre>fish.py mean.fish -v 10 100 47 207.4</pre>
Line 1,164 ⟶ 1,413:
=={{header|Forth}}==
<
0e
dup 0= if 2drop exit then
Line 1,173 ⟶ 1,422:
create test 3e f, 1e f, 4e f, 1e f, 5e f, 9e f,
test 6 fmean f. \ 3.83333333333333</
=={{header|Fortran}}==
In ISO Fortran 90 or later, use the SUM intrinsic, the SIZE intrinsic and the MAX intrinsic (to avoid divide by zero):
<
real, dimension(5,20) :: b = reshape( a, (/ 5,20 /) )
real, pointer, dimension(:) :: p => a(2:1) ! pointer to zero-length array
Line 1,196 ⟶ 1,445:
! dividing by the length of the row, which is the number of columns (SIZE of dimension 2)
colmeans = sum(b,2)/max(size(b,1),1) ! SUM elements in each column (dimension 2)
! dividing by the length of the column, which is the number of rows (SIZE of dimension 1)</
=={{header|FreeBASIC}}==
<
' FB 1.05.0 Win64
Line 1,242 ⟶ 1,491:
Print "Press any key to quit the program"
Sleep
</syntaxhighlight>
{{out}}
Line 1,264 ⟶ 1,513:
=={{header|Frink}}==
The following works on arrays or sets. If the collection is empty, this returns the special value <CODE>undef</CODE>.
<
mean[x] := length[x] > 0 ? sum[x] / length[x] : undef
</syntaxhighlight>
=={{header|FutureBasic}}==
<syntaxhighlight lang="futurebasic">
local fn MeanAverageOfNumberArray( numberArr as CFArrayRef ) as CFStringRef
CFStringRef result = NULL
if len(numberArr) == 0 then result = @"Mean undefined for empty array." : exit fn
result = fn StringWithFormat( @"Mean average of %d numbers: %@", len(numberArr), fn ObjectValueForKeyPath( numberArr, @"@avg.self" ) )
end fn = result
CFArrayRef numberArray
numberArray = @[@1, @2, @3, @4, @5, @6, @7, @8, @9, @10]
print fn MeanAverageOfNumberArray( numberArray )
numberArray = @[@3, @1, @4, @1, @5, @9]
print fn MeanAverageOfNumberArray( numberArray )
HandleEvents
</syntaxhighlight>
{{output}}
<pre>
Mean average of 10 numbers: 5.5
Man average of 6 numbers: 3.83333333333333333333333333333333333333
</pre>
</pre>
=={{header|GAP}}==
<
local n;
n := Length(v);
Line 1,280 ⟶ 1,556:
Mean([3, 1, 4, 1, 5, 9]);
# 23/6</
=={{header|GEORGE}}==
<
0
1, n rep (i)
Line 1,289 ⟶ 1,565:
]
n div
P</
Output:
<pre>
Line 1,309 ⟶ 1,585:
This works for arrays of integers.
<syntaxhighlight lang="text">
DIM a%(10)
FOR i%=0 TO 10
Line 1,333 ⟶ 1,609:
RETURN sum/size%
ENDFUNC
</syntaxhighlight>
=={{header|Go}}==
A little more elaborate that the task requires. The function "mean" fulfills the task of "a program to find the mean." As a Go idiom, it returns an ok value of true if result m is valid. An ok value of false means the input "vector" (a Go slice) was empty. The fancy accuracy preserving algorithm is a little more than was called more. The program main is a test program demonstrating the ok idiom and several data cases.
<
import (
Line 1,402 ⟶ 1,678:
}
}
}</
{{out}}
<pre>
Line 1,428 ⟶ 1,704:
=={{header|Groovy}}==
<
Test Program:
<
println avg([2,2,2,4,2])
println avg ([])</
Output:
Line 1,442 ⟶ 1,718:
=={{header|Haskell}}==
This function works if the element type is an instance of Fractional:
<
mean [] = 0
mean xs = sum xs / Data.List.genericLength xs</
But some types, e.g. integers, are not Fractional; the following function works for all Real types:
<
meanReals = mean . map realToFrac</
If you want to avoid keeping the list in memory and traversing it twice:
<
import Data.List (foldl') --'
Line 1,470 ⟶ 1,746:
main :: IO ()
main = print $ mean [1 .. 100]</
=={{header|HicEst}}==
<
vec = $ - 1/2 ! 0.5 ... 99.5
mean = SUM(vec) / LEN(vec) ! 50
END </
=={{header|Hy}}==
Returns <tt>None</tt> if the input is of length zero.
<
(if xs
(/ (sum xs) (len xs))))</
=={{header|Icon}} and {{header|Unicon}}==
<
every (s := 0) +:= !args
write((real(s)/(0 ~= *args)) | 0)
end</
Sample outputs:
Line 1,502 ⟶ 1,778:
If truly only the mean is wanted, one could use
<
print,mean(x)</
But <tt>mean()</tt> is just a thin wrapper returning the zeroth element of <tt>moment()</tt> :
<
; ==>
3.83333 8.96667 0.580037 -1.25081</
which are mean, variance, skewness and kurtosis.
Line 1,517 ⟶ 1,793:
=={{header|J}}==
<
That is, sum divided by the number of items. The verb also works on higher-ranked arrays. For example:
<
3.83333
mean $0 NB. $0 is a zero-length vector
Line 1,527 ⟶ 1,803:
x=: 20 4 ?@$ 0 NB. a 20-by-4 table of random (0,1) numbers
mean x
0.58243 0.402948 0.477066 0.511155</
The computation can also be written as a loop. It is shown here for comparison only and is highly non-preferred compared to the version above.
<
z=. 0
for_i. i.#y do. z=. z+i{y end.
Line 1,541 ⟶ 1,817:
0
mean1 x
0.58243 0.402948 0.477066 0.511155</
=={{header|Java}}==
{{works with|Java|1.5+}}
<
double sum = 0.0;
for (double x : arr) {
Line 1,552 ⟶ 1,828:
}
return sum / arr.length;
}</
=={{header|JavaScript}}==
Line 1,558 ⟶ 1,834:
===ES5===
<
{
var sum = 0, i;
Line 1,569 ⟶ 1,845:
alert( mean( [1,2,3,4,5] ) ); // 3
alert( mean( [] ) ); // 0</
Using the native function `.forEach()`:
<
var sum = 0;
array.forEach(function(value){
Line 1,580 ⟶ 1,856:
}
alert( mean( [1,2,3,4,5] ) ); // 3</
Using the native function `.reduce()`:
<
return !array.length ? 0
: array.reduce(function(pre, cur, i) {
Line 1,592 ⟶ 1,868:
alert( mean( [1,2,3,4,5] ) ); // 3
alert( mean( [] ) ); // 0
</syntaxhighlight>
Extending the `Array` prototype:
<
return !this.length ? 0
: this.reduce(function(pre, cur, i) {
Line 1,604 ⟶ 1,880:
alert( [1,2,3,4,5].mean() ); // 3
alert( [].mean() ); // 0
</syntaxhighlight>
{{libheader|Functional}}
<
{
return a.length ? Functional.reduce('+', 0, a) / a.length : 0;
}</
===ES6===
<
// mean :: [Num] => (Num | NaN)
Line 1,629 ⟶ 1,905:
return mean(sample);
})([1, 2, 3, 4, 5, 6, 7, 8, 9]);</
{{Out}}
<syntaxhighlight lang="javascript">5</syntaxhighlight>
=={{header|Joy}}==
<syntaxhighlight lang="joy">DEFINE avg == dup 0. [+] fold swap size 1 max /.</syntaxhighlight>
=={{header|jq}}==
The mean of an array of numbers can be computed by simply writing
<syntaxhighlight lang
This definition raises an error condition if the array is empty, so it may make sense to define '''mean''' as follows, '''null''' being jq's null value:
<
else add/length
end;</
=={{header|Julia}}==
Julia's built-in mean function accepts AbstractArrays (vector, matrix, etc.)
<
2.0
julia> mean(1:10)
5.5
julia> mean([])
ERROR: mean of empty collection undefined: []</
=={{header|K}}==
<
mean 1 2 3 5 7
3.6
mean@!0 / empty array
0.0</
=={{header|Kotlin}}==
Kotlin has builtin functions for some collection types.
Example:
<
val nums = doubleArrayOf(1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0)
println("average = %f".format(nums.average()))
}</
=={{header|KQL}}==
<
let dataset = datatable(values:real)[
1, 1.5, 3, 5, 6.5];
dataset|summarize avg(values)
</syntaxhighlight>
Output:
Line 1,686 ⟶ 1,965:
=={{header|Lambdatalk}}==
<
{def mean
{lambda {:s}
Line 1,695 ⟶ 1,974:
{mean {S.serie 0 1000}}
-> 500
</syntaxhighlight>
=={{header|langur}}==
Line 1,702 ⟶ 1,981:
We could use fold() to write a function that takes an array and calculates the mean.
<syntaxhighlight lang="langur">val .mean = fn .x: fold(fn{+}, .x) / len(.x)
writeln " custom: ", .mean([7, 3, 12])
writeln "built-in: ", mean([7, 3, 12])</
{{out}}
Line 1,713 ⟶ 1,991:
=={{header|Lasso}}==
<
not #a->size ? return 0
local(x = 0.0)
Line 1,720 ⟶ 1,998:
}
average(array(1,2,5,17,7.4)) //6.48</
=={{header|LFE}}==
Line 1,726 ⟶ 2,004:
=== 1-Arity ===
<
(defun mean (data)
(/ (lists:sum data)
(length data)))
</syntaxhighlight>
Usage:
<
1.0
> (mean '(1 2))
Line 1,740 ⟶ 2,018:
6.0
> (mean '(6 12 18 24 30 36 42 48 54 60 66 72 78))
42.0</
=== n-Arity ===
Line 1,746 ⟶ 2,024:
Functions in LFE (and Erlang) have set arity, but macros can be used to provide the same use as n-arity functions:
<
`(/ (lists:sum ,args)
,(length args)))</
Usage:
<
42.0
> (mean 18 66)
42.0
> (mean 6 12 18 24 30 36 42 48 54 60 66 72 78)
42.0</
=={{header|Liberty BASIC}}==
<
dim nums(total)
for i = 1 to total
Line 1,771 ⟶ 2,049:
if total=0 then mean=0 else mean=sum/total
print "Arithmetic mean: ";mean
</
=={{header|Limbo}}==
<
include "sys.m";
Line 1,797 ⟶ 2,075:
n += a[i];
return n / (real len a);
}</
=={{header|Lingo}}==
<
on mean (v)
case ilk(v) of
Line 1,813 ⟶ 2,091:
end repeat
return float(sum)/cnt
end</
<
-- 1.7500
put mean(vector(1.2, 4.7, 5.6))
-- 3.8333
put mean([6,12,18,24,30,36,42,48,54,60,66,72,78])
-- 42.0000</
=={{header|LiveCode}}==
Livecode provides arithmeticMean (avg, average) built-in.
<
average(empty) -- 0</
=={{header|Logo}}==
<
if empty? :l [output 0]
output quotient apply "sum :l count :l
end
print average [1 2 3 4] ; 2.5</
=={{header|Logtalk}}==
Logtalk's standard library provides an arithmetic average predicate but we ignore it here. Representing a vector using a list:
<
:- object(averages).
Line 1,854 ⟶ 2,132:
:- end_object.
</syntaxhighlight>
Sample output:
<
| ?- averages::arithmetic([1,2,3,4,5,6,7,8,9,10], Mean).
Mean = 5.5
yes
</syntaxhighlight>
=={{header|LSL}}==
<
integer MAX_VALUE = 100;
default {
Line 1,884 ⟶ 2,162:
llOwnerSay(" Sum Squares: "+(string)llListStatistics(LIST_STAT_SUM_SQUARES, lst));
}
}</
Output:
<pre>
Line 1,901 ⟶ 2,179:
=={{header|Lua}}==
<
if type(numlist) ~= 'table' then return numlist end
num = 0
Line 1,908 ⟶ 2,186:
end
print (mean({3,1,4,1,5,9}))</
=={{header|Lucid}}==
<
where
sum = first(x) fby sum + next(x);
n = 1 fby n + 1;
avg = sum / n;
end</
=={{header|M4}}==
Line 1,925 ⟶ 2,203:
directly, but it is a little bit clearer to keep them separated.
<
define(`fmean', `eval(`($2/$1)/100').extractdec(eval(`$2/$1'))')dnl
define(`mean', `rmean(`$#', $@)')dnl
define(`rmean', `ifelse(`$3', `', `fmean($1,$2)',dnl
`rmean($1, eval($2+$3), shift(shift(shift($@))))')')dnl</
<
=={{header|Maple}}==
This version accepts any indexable structure, including numeric arrays. We use a call to the "environment variable" (dynamically scoped global) "Normalizer" to provide normalization of symbolic expressions. This can be set by the caller to adjust the strength of normalization desired.
<syntaxhighlight lang="maple">
mean := proc( a :: indexable )
local i;
Normalizer( add( i, i in a ) / numelems( a ) )
end proc:
</syntaxhighlight>
For example:
<syntaxhighlight lang="maple">
> mean( { 1/2, 2/3, 3/4, 4/5, 5/6 } ); # set
71
Line 1,963 ⟶ 2,241:
> mean([]); # empty argument causes an exception to be raised.
Error, (in mean) numeric exception: division by zero
</syntaxhighlight>
A slightly different design computes the mean of all its arguments, instead of requiring a single container argument. This seems a little more Maple-like for a general purpose utility.
<
This can be called as in the following examples.
<syntaxhighlight lang="maple">
> mean( 1, 2, 3, 4, 5 );
3
Line 1,978 ⟶ 2,256:
> mean(); # again, an exception is raised
Error, (in mean) numeric exception: division by zero
</syntaxhighlight>
If desired, we can add argument type-checking as follows.
<
=={{header|Mathematica}} / {{header|Wolfram Language}}==
Modify the built-in Mean function to give 0 for empty vectors (lists in Mathematica):
<
Mean[{}] := 0</
Examples:
<
Mean[{3.2,4.5,5.9}]
Mean[{-4, 1.233}]
Mean[{}]
Mean[{1/2,1/3,1/4,1/5}]
Mean[{a,c,Pi,-3,a}]</
gives (a set of integers gives back an integer or a rational, a set of floats gives back a float, a set of rationals gives a rational back, a list of symbols and numbers keeps the symbols exact and a mix of exact and approximate numbers gives back an approximate number):
<
4.53333
-1.3835
0
77/240
1/5 (-3+2 a+c+Pi)</
=={{header|Mathprog}}==
Line 2,011 ⟶ 2,289:
To make it more interesting I find the Arithmectic Mean of more than a million Integers.
<syntaxhighlight lang="text">
/*Arithmetic Mean of a large number of Integers
- or - solve a very large constraint matrix
Line 2,036 ⟶ 2,314:
end;
</syntaxhighlight>
When run this produces:
<syntaxhighlight lang="text">
GLPSOL: GLPK LP/MIP Solver, v4.47
Parameter(s) specified in the command line:
Line 2,063 ⟶ 2,341:
The arithmetic mean of the integers from 1 to 1048575 is 524288.000000
Model has been successfully processed
</syntaxhighlight>
=={{header|MATLAB}}==
<
meanValue = mean(setOfValues);
end</
=={{header|Maxima}}==
<
mean([2, 7, 11, 17]);</
=={{header|MAXScript}}==
<
(
total = 0
Line 2,085 ⟶ 2,363:
)
print (mean #(3, 1, 4, 1, 5, 9))</
=={{header|Mercury}}==
<
:- interface.
Line 2,107 ⟶ 2,385:
mean(Ns @ [_ | _]) = foldl((+), Ns, 0.0) / float(length(Ns)).
:- end_module arithmetic_mean.</
Alternatively, we could use inst subtyping to ensure we get a compilation error if the
mean function is called with an empty list.
<
mean(Ns) = foldl((+), Ns, 0.0) / float(length(Ns)).</
=={{header|min}}==
Returns <code>nan</code> for an empty quotation.
{{works with|min|0.
<syntaxhighlight lang
{{out}}
<pre>3.333333333333333</pre>
=={{header|MiniScript}}==
<
avg = function(arr)
Line 2,138 ⟶ 2,413:
end function
print avg(arr)</
=={{header|МК-61/52}}==
<syntaxhighlight lang="text">0 П0 П1 С/П ИП0 ИП1 * + ИП1 1
+ П1 / П0 БП 03</
''Instruction:'' В/О С/П Number С/П Number ...
Line 2,149 ⟶ 2,424:
=={{header|Modula-2}}==
<
VAR avg : REAL;
Line 2,158 ⟶ 2,433:
InOut.WriteReal (avg, 8, 2);
InOut.WriteLn
END Avg;</
OR
<
(* Calculate the average over 'Samples' values, stored in array 'Data'. *)
Line 2,173 ⟶ 2,448:
END;
RETURN sum / FLOAT(Samples)
END Average;</
=={{header|MUMPS}}==
<
;X is assumed to be a list of numbers separated by "^"
QUIT:'$DATA(X) "No data"
Line 2,183 ⟶ 2,458:
SET S=0,I=1
FOR QUIT:I>$L(X,"^") SET S=S+$P(X,"^",I),I=I+1
QUIT (S/$L(X,"^"))</
<pre>USER>W $$MEAN^ROSETTA
No data
Line 2,195 ⟶ 2,470:
=={{header|Nanoquery}}==
<
sum = 0
for n in lst
Line 2,205 ⟶ 2,480:
def average(x)
return sum(x) / len(x)
end</
=={{header|Nemerle}}==
<
using System.Console;
using Nemerle.Collections;
Line 2,224 ⟶ 2,499:
WriteLine("Mean of [1 .. 10]: {0}", ArithmeticMean($[1 .. 10]));
}
}</
=={{header|NetRexx}}==
<
options replace format comments java crossref symbols nobinary
Line 2,278 ⟶ 2,553:
]
return vectors
</syntaxhighlight>
'''Output:'''
<pre>
Line 2,302 ⟶ 2,577:
=={{header|NewLISP}}==
<
(if (empty? Lst)
0
Line 2,308 ⟶ 2,583:
(Mean (sequence 1 1000))-> 500
(Mean '()) -> 0</
=={{header|Nial}}==
in the standard way, mean is
<
mean 6 2 4
= 4</
but it fails with 0 length vectors. so using a tally with a minimum value 1
<
mean is / [sum, dtally]
mean []
=0</
=={{header|Nim}}==
{{trans|C}}
<
proc mean(xs: openArray[float]): float =
Line 2,336 ⟶ 2,611:
for i in 0..5:
echo "mean of first ", v.len, " = ", formatFloat(mean(v), precision = 0)
if v.len > 0: v.setLen(v.high)</
Output:
<pre>mean of first 5 = 2.372
Line 2,346 ⟶ 2,621:
=={{header|Niue}}==
<syntaxhighlight lang="niue">
[ [ , len 1 - at ! ] len 3 - times swap , ] 'map ; ( a Lisp like map, to sum the stack )
[ len 'n ; [ + ] 0 n swap-at map n / ] 'avg ;
Line 2,354 ⟶ 2,629:
3.4 2.3 .01 2.0 2.1 avg .
=> 1.9619999999999997
</syntaxhighlight>
=={{header|Oberon-2}}==
Oxford Oberon-2
<
MODULE AvgMean;
IMPORT Out;
Line 2,388 ⟶ 2,663:
Out.Fixed(Avg(ary),4,2);Out.Ln
END AvgMean.
</syntaxhighlight>
Output:
<pre>
Line 2,395 ⟶ 2,670:
=={{header|Objeck}}==
<
function : native : PrintAverage(values : FloatVector) ~ Nil {
values->Average()->PrintLine();
}
</syntaxhighlight>
=={{header|OCaml}}==
These functions return a float:
<
| [] -> 0.
| xs -> List.fold_left (+.) 0. xs /. float_of_int (List.length xs)
let mean_ints xs = mean_floats (List.map float_of_int xs)</
the previous code is easier to read and understand, though if you wish
Line 2,420 ⟶ 2,695:
would rather be handled by an exception.
<
if xs = [] then
invalid_arg "empty list"
Line 2,443 ⟶ 2,718:
in
(float total /. length)
;;</
=={{header|Octave}}==
Line 2,449 ⟶ 2,724:
GNU Octave has a <tt>mean</tt> function (from statistics package), but it does not handle an empty vector; an implementation that allows that is:
<
if ( numel(l) == 0 )
m = 0;
Line 2,458 ⟶ 2,733:
disp(omean([]));
disp(omean([1,2,3]));</
If the data contains missing value, encoded as non-a-number:
<
n = sum(~isnan(l));
l(isnan(l))=0;
s = sum(l);
m = s./n;
end;</
=={{header|Oforth}}==
<
x sum
x size dup ifZero: [ 2drop null ] else: [ >float / ]
;</
{{out}}
Line 2,485 ⟶ 2,760:
=={{header|ooRexx}}==
<syntaxhighlight lang="oorexx">
call testAverage .array~of(10, 9, 8, 7, 6, 5, 4, 3, 2, 1)
call testAverage .array~of(10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0, 0, 0, .11)
Line 2,507 ⟶ 2,782:
end
return sum/numbers~items
</syntaxhighlight>
Output:
<pre>
Line 2,525 ⟶ 2,800:
=={{header|Oz}}==
A version working on floats:
<
fun {Mean Xs}
{FoldL Xs Number.'+' 0.0} / {Int.toFloat {Length Xs}}
end
in
{Show {Mean [3. 1. 4. 1. 5. 9.]}}</
=={{header|PARI/GP}}==
<
if(#v,vecsum(v)/#v)
};</
=={{header|Pascal}}==
<
function DoMean(vector: array of double): double;
Line 2,567 ⟶ 2,842:
writeln (']');
writeln('Mean: ', DoMean(vector):10:8);
end.</
Output:
Line 2,578 ⟶ 2,853:
Alternative version using the Math unit:
<
uses math;
const
Line 2,595 ⟶ 2,870:
mean := sum(vector)/length(vector);
writeln('Mean: ', mean:10:8);
end.</
=={{header|Perl}}==
<
@_ or return 0;
my $sum = 0;
Line 2,605 ⟶ 2,880:
}
print avg(qw(3 1 4 1 5 9)), "\n";</
=={{header|Phix}}==
<!--<syntaxhighlight lang="phix">(phixonline)-->
<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>
<span style="color: #008080;">function</span> <span style="color: #000000;">mean</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">s</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">if</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">)=</span><span style="color: #000000;">0</span> <span style="color: #008080;">then</span> <span style="color: #008080;">return</span> <span style="color: #000000;">0</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span>
<span style="color: #008080;">return</span> <span style="color: #7060A8;">sum</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">)/</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #0000FF;">?</span> <span style="color: #000000;">mean</span><span style="color: #0000FF;">({</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">2</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">5</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">-</span><span style="color: #000000;">5</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">-</span><span style="color: #000000;">9.5</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">3.14159</span><span style="color: #0000FF;">})</span>
<!--</syntaxhighlight>-->
=={{header|Phixmonti}}==
<
len swap sum swap / print</
=={{header|PHP}}==
<
if ($nums)
echo array_sum($nums) / count($nums), "\n";
else
echo "0\n";</
=={{header|Picat}}==
<syntaxhighlight lang="picat">mean([]) = false.
mean(V) = sum(V) / len(V).</syntaxhighlight>
=={{header|PicoLisp}}==
<
(if (atom Lst)
0
(/ (apply + Lst) (length Lst)) ) )</
Output:
<pre>: (mean (range 1 1000))
Line 2,636 ⟶ 2,919:
=={{header|PL/I}}==
<
=={{header|Plain English}}==
<
Start up.
Demonstrate finding the arithmetic mean.
Line 2,688 ⟶ 2,971:
If the entry's next is not nil, append ", " to the string.
Put the entry's next into the entry.
Repeat.</
{{out}}
<pre>
Line 2,697 ⟶ 2,980:
=={{header|Pop11}}==
<
lvars n = length(v), i, s = 0;
if n = 0 then
Line 2,707 ⟶ 2,990:
endif;
return(s/n);
enddefine;</
=={{header|PostScript}}==
<syntaxhighlight lang="text">
/findmean{
/x exch def
Line 2,726 ⟶ 3,009:
sum ==
}def
</syntaxhighlight>
{{libheader|initlib}}
{{works with|Ghostscript}}
<
/avg {
dup length
Line 2,739 ⟶ 3,022:
} ifte
}.
</syntaxhighlight>
=={{header|PowerShell}}==
The hard way by calculating a sum and dividing:
<
if ($x.Count -eq 0) {
return 0
Line 2,753 ⟶ 3,036:
return $sum / $x.Count
}
}</
or, shorter, by using the <code>Measure-Object</code> cmdlet which already knows how to compute an average:
<
if ($x.Count -eq 0) {
return 0
Line 2,761 ⟶ 3,044:
return ($x | Measure-Object -Average).Average
}
}</
=={{header|Processing}}==
<
float out = 0;
for (float n : arr) {
Line 2,770 ⟶ 3,053:
}
return out / arr.length;
}</
=={{header|Prolog}}==
Line 2,776 ⟶ 3,059:
{{works with|SWI-Prolog|6.6}}
<
mean(List, Mean) :-
length(List, Length),
sumlist(List, Sum),
Mean is Sum / Length.
</syntaxhighlight>
=={{header|PureBasic}}==
<
Protected sum=0
Line 2,792 ⟶ 3,075:
ProcedureReturn sum / ListSize(number())
; Depends on programm if zero check needed, returns nan on division by zero
EndProcedure</
=={{header|Python}}==
{{works with|Python|3.0}}.<br>{{works with|Python|2.6}}<br>
Uses [http://docs.python.org/3.3/library/math.html?highlight=fsum#math.fsum fsum] which tracks multiple partial sums to avoid losing precision
<
def average(x):
return fsum(x)/float(len(x)) if x else 0
print (average([0,0,3,1,4,1,5,9,0,0]))
print (average([1e20,-1e-20,3,1,4,1,5,9,-1e20,1e-20]))</
{{out}}
<
2.3</
{{works with|Python|2.5}}
<
return sum(x)/float(len(x)) if x else 0
print (average([0,0,3,1,4,1,5,9,0,0]))
print (average([1e20,-1e-20,3,1,4,1,5,9,-1e20,1e-20]))</
{{out}}
(Notice how the second call gave the wrong result)
<
1e-21</
{{works with|Python|2.4}}
<
if len(data)==0:
return 0
else:
return sum(data)/float(len(data))
print avg([0,0,3,1,4,1,5,9,0,0])</
{{out}}
<syntaxhighlight lang
{{works with|Python|3.4}}
Since 3.4, Python has a [[http://docs.python.org/3/library/statistics.html statistics] library in the stdlib, which takes care of these precision overflow issues in a way that works for all standard types, not just float, even with values way too big or small to fit in a float. (For Python 2.6-2.7, there's a backport available on PyPI.)
<
>>> mean([1e20,-1e-20,3,1,4,1,5,9,-1e20,1e-20])
2.3
Line 2,842 ⟶ 3,125:
>>> big = 10**10000
>>> mean([Decimal(big), Decimal(-big), 3, 1, 4, 1, 5, 9, 1/Decimal(big), -1/Decimal(big)])
Decimal('2.3')</
=={{header|Q}}==
A built-in solution is <tt>avg</tt>. An implementation of it could be:
<
=={{header|Quackery}}==
Line 2,852 ⟶ 3,135:
Using the Quackery big number rational arithmetic library <code>bigrat.qky</code>.
<
[ [] swap times
Line 2,903 ⟶ 3,186:
proper$ echo$
say ", "
vulgar$ echo$ cr ] is demonstrate ( --> )</
{{out}}
Line 2,927 ⟶ 3,210:
20 decimal places and a denominator not exceeding 100.
-0.41664995487817106187, -
=={{header|R}}==
R has its <tt>mean</tt> function but it does not allow for NULL (void vectors or whatever) as argument: in this case it raises a warning and the result is NA. An implementation that does not suppress the warning could be:
<
m <- mean(v)
ifelse(is.na(m), 0, m)
}</
=={{header|Racket}}==
Line 2,941 ⟶ 3,224:
Racket's math library (available in v5.3.2 and newer) comes with a <tt>mean</tt> function that works on arbitrary sequences.
<
#lang racket
(require math)
Line 2,948 ⟶ 3,231:
(mean '(2 2 4 4)) ; -> 3
(mean #(3 4 5 8)) ; -> 5
</syntaxhighlight>
=={{header|Raku}}==
Line 2,954 ⟶ 3,237:
{{works with|Rakudo|2015.10-11}}
<syntaxhighlight lang="raku"
multi mean (@a) { ([+] @a) / @a }</
=={{header|Rapira}}==
<syntaxhighlight lang="rapira">fun mean(arr)
sum := 0
for N from 1 to #arr do
sum := sum + arr[N]
od
return (sum / #arr)
end</syntaxhighlight>
=={{header|REBOL}}==
<
Title: "Arithmetic Mean (Average)"
URL: http://rosettacode.org/wiki/Average/Arithmetic_mean
Line 2,976 ⟶ 3,268:
print [mold x: [3 1 4 1 5 9] "->" average x]
print [mold x: [1000 3 1 4 1 5 9 -1000] "->" average x]
print [mold x: [1e20 3 1 4 1 5 9 -1e20] "->" average x]</
Output:
Line 2,987 ⟶ 3,279:
=={{header|Red}}==
Red comes with the <code>average</code> function.
<
print average []
print average [2 3 5]</
{{out}}
<pre>
Line 2,998 ⟶ 3,290:
The source code for <code>average</code>:
<
"Returns the average of all values in a block"
block [block! vector! paren! hash!]
Line 3,004 ⟶ 3,296:
if empty? block [return none]
divide sum block to float! length? block
]</
=={{header|ReScript}}==
<syntaxhighlight lang="rescript">let arr = [3, 8, 4, 1, 5, 12]
let num = Js.Array.length(arr)
let tot = Js.Array.reduce(\"+", 0, arr)
let mean = float_of_int(tot) /. float_of_int(num)
Js.log(Js.Float.toString(mean))</syntaxhighlight>
{{out}}
<pre>
$ bsc arithmean.res > arithmean.js
$ node arithmean.js
5.5
</pre>
=={{header|REXX}}==
Line 3,010 ⟶ 3,318:
A check is made to validate if the numbers in the list are all numeric.
<
parse arg @.1; if @.1='' then do; #=6 /*vector from the C.L.?*/
@.1 = 10 9 8 7 6 5 4 3 2 1
Line 3,036 ⟶ 3,344:
if #==0 then return 'N/A: ───[no numeric values.]' /*No nums? Return N/A*/
return $ / # /*return the average. */</
'''output''' when using the (internal) lists:
<pre>
Line 3,071 ⟶ 3,379:
=={{header|Ring}}==
<
nums = [1,2,3,4,5,6,7,8,9,10]
sum = 0
Line 3,081 ⟶ 3,389:
next
return sum/len(numbers)
</syntaxhighlight>
=={{header|RPL
This is based on the dc version above.
{{works with|HP|48G}}
≪ DUP 'N' STO →LIST ΣLIST N / 'N' PURGE ≫ '<span style="color:blue">AMEAN</span>' STO
or,by using the stack instead of a temporary variable:
≪ →LIST ΣLIST LASTARG SIZE / ≫ '<span style="color:blue">AMEAN</span>' STO
CLEAR 1 2 3 5 7 DEPTH <span style="color:blue">AMEAN</span>
===Hard-working approach===
Works for all RPL versions.
≪ DUP SIZE SWAP OVER
0 1 ROT '''FOR''' j
OVER j GET + '''NEXT'''
ROT / SWAP DROP
≫
===Hard-working approach with local variables===
No significant impact on program size or speed, but much more readable
≪ DUP SIZE → vector n
≪ 0 1 n '''FOR''' j
vector j GET + '''NEXT'''
n /
≫ ≫
===Straightforward approach===
The dot product of any vector with [1 1 ... 1] gives the sum of its elements.
≪ SIZE LAST DUP 1 CON DOT SWAP / ≫
''''AMEAN'''' STO
===Using built-in statistics features===
Most of the code is dedicated to store the input array according to built-in statistics requirements, which requires a matrix with one line per record. Main benefit of this approach is that you can then easily calculate standard deviation and variance by calling resp. <code>SDEV</code> and <code>VAR</code> functions.
≪ { 1 } OVER SIZE + RDM TRN '∑DAT' STO MEAN ≫ ''''AMEAN'''' STO
[ 1 5 0 -4 6 ] '''AMEAN'''
{{out}}
<pre>
1: 1.6
</pre>
=={{header|Ruby}}==
<
nums.sum(0.0) / nums.size
end
Line 3,101 ⟶ 3,438:
ary = nums[0,i]
puts "array size #{ary.size} : #{mean(ary)}"
end</
{{out}}
<pre>
Line 3,114 ⟶ 3,451:
=={{header|Run BASIC}}==
<
dim value(numArray)
for i = 1 to numArray
Line 3,124 ⟶ 3,461:
next
if totValue <> 0 then mean = totValue/numArray
print "The mean is: ";mean</
=={{header|Rust}}==
<
arr.iter().fold(0.0, |p,&q| p + q)
}
Line 3,141 ⟶ 3,478:
let w = &[];
println!("mean of {:?}: {:?}", w, mean(w));
}</
Output:
<pre>mean of [2, 3, 5, 7, 13, 21, 33, 54]: 17.25
Line 3,148 ⟶ 3,485:
=={{header|Sather}}==
Built to work with VEC, ("geometric" vectors), whose elements must be floats. A 0-dimension vector yields "nan".
<
mean(v:VEC):FLT is
m ::= 0.0;
Line 3,161 ⟶ 3,498:
#OUT + VECOPS::mean(v) + "\n";
end;
end;</
=={{header|Scala}}==
Using Scala 2.7, this has to be defined for each numeric type:
<
However, Scala 2.8 gives much more flexibility, but you still have to opt
between integral types and fractional types. For example:
<
import n._
s.foldLeft(zero)(_+_) / fromInt(s.size)
}</
This can be used with any subclass of <tt>Sequence</tt> on integral types, up
Line 3,184 ⟶ 3,521:
Alas, Scala 2.8 also simplifies the task in another way:
<
Here we show a function that supports fractional types. Instead of importing the definitions
Line 3,192 ⟶ 3,529:
=={{header|Scheme}}==
<
(if (null? l)
0
(/ (apply + l) (length l))))</
> (mean (list 3 1 4 1 5 9))
Line 3,201 ⟶ 3,538:
=={{header|Seed7}}==
<
include "float.s7i";
Line 3,224 ⟶ 3,561:
begin
writeln(mean(numVector));
end func;</
=={{header|SenseTalk}}==
SenseTalk has a built-in average function.
<
put average(empty)
</syntaxhighlight>
{{out}}
<pre>
Line 3,239 ⟶ 3,576:
=={{header|Sidef}}==
<
list.len > 0 || return 0
list.sum / list.len
}
say avg([
say avg([3,1,4,1,5,9])
say avg([1e+20, 3, 1, 4, 1, 5, 9, -1e+20])
say avg([10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0, 0, 0, 0.11])
say avg([10, 20, 30, 40, 50, -100, 4.7, -1100])
{{out}}
<pre>
Inf
3.83333333333333333333333333333333333333333333333
2.875
3.674
-130.6625
</pre>
=={{header|Slate}}==
<
[|:list| (list reduce: #+ `er ifEmpty: [0]) / (list isEmpty ifTrue: [1] ifFalse: [list size])] applyWith: {}.</
=={{header|Smalltalk}}==
<
| numbers |
Line 3,271 ⟶ 3,610:
(numbers inject: 0 into: [:sumSoFar :eachElement | sumSoFar + eachElement]) / numbers size ]
) displayNl.
</syntaxhighlight>
However, the empty check can be omitted, as inject returns the injected value for empty collections, and we probably do not care for the average of nothing (i.e. the division by zero exception):
<
| numbers |
numbers := #(1 2 3 4 5 6 7 8).
( numbers inject: 0 into: [:sumSoFar :eachElement | sumSoFar + eachElement]) / numbers size] ) displayNl.
</syntaxhighlight>
also, most Smalltalk's collection classes already provide sum and average methods, which makes it:
{{works with|Pharo}}
{{works with|Smalltalk/X}}
<
| numbers |
numbers := #(1 2 3 4 5 6 7 8).
(numbers sum / numbers size) displayNl.
</syntaxhighlight>
or
<
| numbers |
numbers := #(1 2 3 4 5 6 7 8).
numbers average displayNl.
</syntaxhighlight>
=={{header|SNOBOL4}}==
Line 3,302 ⟶ 3,641:
{{works with|CSnobol}}
<
avg i = i + 1; sum = sum + a<i> :s(avg)
avg = 1.0 * sum / prototype(a) :(return)
Line 3,315 ⟶ 3,654:
output = '[' str '] -> ' avg(arr)
output = '[ ] -> ' avg(empty)
end</
Output:
Line 3,323 ⟶ 3,662:
=={{header|SQL}}==
Tested on Oracle 11gR2, the more limited the tool, the more resourceful one becomes :)
<syntaxhighlight lang="sql">
create table "numbers" ("datapoint" integer);
Line 3,329 ⟶ 3,668:
select sum("datapoint")/count(*) from "numbers";
</syntaxhighlight>
...or...
<
=={{header|Standard ML}}==
These functions return a real:
<
| mean_reals xs = foldl op+ 0.0 xs / real (length xs);
val mean_ints = mean_reals o (map real);</
The previous code is easier to read and understand, though if you want
Line 3,349 ⟶ 3,688:
would rather be handled by an exception.
<
| mean_reals xs = let
val (total, length) =
Line 3,368 ⟶ 3,707:
in
(real total / length)
end;</
=={{header|Stata}}==
=== Mean of a dataset variable ===
Illustration of the mean on the population (in millions) in january 2016 of a few european countries (source [http://appsso.eurostat.ec.europa.eu/nui/show.do?dataset=demo_gind&lang=fr Eurostat]).
<syntaxhighlight lang="text">clear all
input str20 country population
Belgium 11311.1
Line 3,403 ⟶ 3,742:
. quietly summarize population
. display r(mean)
16715.75</
=== Mean in Mata ===
<
a=11311.1\7153.8\10553.8\5707.3\
82175.7\1315.9\4724.7\10783.7
mean(a)
16715.75</
=={{header|Swift}}==
<
return s.reduce(0, +) / Double(s.count)
}
func meanInts(s: [Int]) -> Double {
return meanDoubles(s.map{Double($0)})
}</
=={{header|Tcl}}==
<
proc mean args {
if {[set num [llength $args]] == 0} {return 0}
expr {[tcl::mathop::+ {*}$args] / double($num)}
}
mean 3 1 4 1 5 9 ;# ==> 3.8333333333333335</
=={{header|TI-83 BASIC}}==
<syntaxhighlight lang
=={{header|TI-89 BASIC}}==
<
=={{header|Trith}}==
<
[3 1 4 1 5 9] mean</
=={{header|TypeScript}}==
<
function mean(numbersArr)
{
Line 3,458 ⟶ 3,797:
alert( mean( [1,2,3,4,5] ) );
alert( mean( [] ) );
</syntaxhighlight>
=={{header|UNIX Shell}}==
1) First solution with bash (V >= 3), works with floats :
<
</syntaxhighlight>
<
1
2
Line 3,486 ⟶ 3,825:
echo "`cat f | paste -sd+ | bc -l`/`cat f | wc -l`" |bc -l
33.23134771428571428571
</syntaxhighlight>
2) This example uses <tt>expr</tt>, so it only works with integers. It checks that each string in the list is an integer.
<
if expr $# >/dev/null; then
(count=0
Line 3,513 ⟶ 3,852:
printf "test 4: "; mean -400 400 -1300 200 # -275
printf "test 5: "; mean - # expr: syntax error
printf "test 6: "; mean 1 2 A 3 # expr: non-numeric argument</
=={{header|UnixPipes}}==
Line 3,520 ⟶ 3,859:
Uses [[ksh93]]-style process substitution. Also overwrites the file named <tt>count</tt> in the current directory.
{{works with|bash}}
<
b=$1;res=$2
echo "scale=5;$res+$b" | bc
Line 3,541 ⟶ 3,880:
}
(echo 3; echo 1; echo 4) | mean</
=={{header|Ursa}}==
<
# arithmetic mean
#
Line 3,554 ⟶ 3,893:
end for
out (/ (+ input) (size input)) endl console</
=={{header|Ursala}}==
There is a library function for means already, although it doesn't cope with
empty vectors. A mean function could be defined as shown for this task.
<
#import flo
Line 3,566 ⟶ 3,905:
#cast %e
example = mean <5.,3.,-2.,6.,-4.></
output:
<pre>1.600000e+00</pre>
=={{header|V}}==
<
[sum 0 [+] fold].
dup sum
swap size [[1 <] [1]] when /
].</
=={{header|Vala}}==
Using array to hold the numbers of the list:
<
double arithmetic(double[] list){
double mean;
Line 3,605 ⟶ 3,944:
stdout.printf("%s\n", mean_zero.to_string());
}
</syntaxhighlight>
Output:
Line 3,614 ⟶ 3,953:
=={{header|VBA}}==
<
Dim sum As Double, i As Integer
sum = 0: i = 0
Line 3,641 ⟶ 3,980:
Debug.Print "] = "; mean(v, leng)
Next leng
End Sub</
<pre>mean[1; 2; 2,178; 3; 3,142] = 0
mean[1; 2; 2,178; 3] = 0
Line 3,650 ⟶ 3,989:
=={{header|VBScript}}==
<syntaxhighlight lang="vb">
Function mean(arr)
size = UBound(arr) + 1
Line 3,662 ⟶ 4,001:
'Example
WScript.Echo mean(Array(3,1,4,1,5,9))
</syntaxhighlight>
{{Out}}
Line 3,669 ⟶ 4,008:
=={{header|Vedit macro language}}==
The numeric data is stored in current edit buffer as ASCII strings, one value per line.
<
#2 = 0 // Count
BOF
Line 3,678 ⟶ 4,017:
}
if (#2) { #1 /= #2 }
Num_Type(#1)</
=={{header|Vim Script}}==
Throws an exception if the list is empty.
<
if empty(a:lst)
throw "Empty"
Line 3,691 ⟶ 4,030:
endfor
return sum / len(a:lst)
endfunction</
=={{header|V (Vlang)}}==
<syntaxhighlight lang="v (vlang)">import math
import arrays
fn main() {
for v in [
[]f64{}, // mean returns ok = false
[math.inf(1), math.inf(1)], // answer is +Inf
// answer is NaN, and mean returns ok = true, indicating NaN
// is the correct result
[math.inf(1), math.inf(-1)],
[f64(3), 1, 4, 1, 5, 9],
[f64(10), 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0, 0, 0, .11],
[f64(10), 20, 30, 40, 50, -100, 4.7, -11e2],
] {
println("Vector: $v")
m := arrays.fold(v, 0.0, fn(r f64, v f64) f64 { return r+v })/v.len
println("Mean of $v.len numbers is $m\n")
}
}</syntaxhighlight>
{{out}}
<pre>Vector: []
Mean of 0 numbers is nan
Vector: [+inf, +inf]
Mean of 2 numbers is +inf
Vector: [+inf, -inf]
Mean of 2 numbers is nan
Vector: [3, 1, 4, 1, 5, 9]
Mean of 6 numbers is 3.8333333333333335
Vector: [10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0, 0, 0, 0.11]
Mean of 15 numbers is 3.674
Vector: [10, 20, 30, 40, 50, -100, 4.7, -1100]
Mean of 8 numbers is -130.66</pre>
=={{header|Wart}}==
<
sum.l / len.l</
Example run:
Line 3,702 ⟶ 4,083:
=={{header|WDTE}}==
<
let a => import 'arrays';
Line 3,708 ⟶ 4,089:
a.stream nums
-> s.reduce [0; 0] (@ s p n => [+ (a.at p 0) 1; + (a.at p 1) n])
-> (@ s p => / (a.at p 1) (a.at p 0));</
This is a tad messier than it has to be due to a lack of a way to get the length of an array in WDTE currently.
Usage:
<
Output:
Line 3,719 ⟶ 4,100:
=={{header|Wortel}}==
<
; using a fork (sum divided-by length)
mean1 @(@sum / #)
Line 3,730 ⟶ 4,111:
!mean2 [3 1 4 1 5 9 2]
]]
}</
Returns:
<pre>[3.5714285714285716 3.5714285714285716]</pre>
=={{header|Wren}}==
<
static mean(arr) {
if (arr.count == 0) Fiber.abort("Length must be greater than zero")
Line 3,741 ⟶ 4,122:
}
}
Arithmetic.mean([1,2,3,4,5]) // 3</
=={{header|XLISP}}==
The specification calls for a function that takes a vector; for convenience, we convert this vector internally to a list. The mean of a zero-length vector is returned as <tt>nil</tt>, equivalent to the empty list or logical <tt>false</tt>.
<
(if (= (vector-length v) 0)
nil
(let ((l (vector->list v)))
(/ (apply + l) (length l)))))</
=={{header|XPL0}}==
<
code real RlOut=48;
Line 3,768 ⟶ 4,149:
[Test:= [1.0, 2.0, 5.0, -5.0, 9.5, 3.14159];
RlOut(0, Mean(Test, 6)); CrLf(0);
]</
Output:
Line 3,779 ⟶ 4,160:
Where <code>$values</code> is some variable indicating a set of nodes containing numbers, the average is given by the XPath expression:
<
===Runnable example===
<
<xsl:output method="text"/>
Line 3,790 ⟶ 4,171:
<xsl:value-of select="sum($values) div count($values)"/>
</xsl:template>
</xsl:stylesheet></
Sample input:
<
<!-- Average is 2.4 -->
<number>1</number>
Line 3,801 ⟶ 4,182:
<number>3</number>
<number>5</number>
</numbers></
=={{header|Yorick}}==
<
if(is_void(x)) return 0;
return x(*)(avg);
}</
=={{header|zkl}}==
Converts int to floats (implicitly):
<
mean(3,1,4,1,5,9); //-->3.83333
mean(); //-->Exception thrown: MathError(NaN (Not a number))</
To pass in a vector/list:
<
meanV(T(3,1,4,1,5,9)); // --> 3.83333</
=={{header|Zoea}}==
<syntaxhighlight lang="zoea">
program: average
case: 1
Line 3,827 ⟶ 4,208:
input: [7,11]
output: 9
</syntaxhighlight>
=={{header|zonnon}}==
<
module Averages;
type
Line 3,848 ⟶ 4,229:
write("arithmetic mean: ");writeln(ArithmeticMean(x):10:2)
end Averages.
</syntaxhighlight>
{{out}}
<pre>
|