Rosetta Code

Sum of Array: Difference between revisions

← Older editNewer edit →
Content deleted Content added
m revert spam
m oops, picked a +-mangled old version
Line 8:
For ($i;1;5)
APPEND TO ARRAY($list;$i)
End for
$var:=0
For ($i;1;Size of array($list))
$var:=$var +$list{$i}
End for
 
==[[Ada]]==
Line 20:
Sum : Integer := 0;
for I in Int_Array'range loop
Sum := Sum + Int_Array(I);
end loop;
 
==[[AppleScript]]==
[[Category:AppleScript]]
Line 30:
repeat with i in array
-- very important -- list index starts at 1 not 0
set product to product + i
end repeat
 
Line 42:
50 REM Find the sum of elements in the array
60 SUM = 0
70 FOR I = 1 TO 5: SUM = SUM + ARRAY(I): NEXT I
80 PRINT "The sum is ";SUM
 
Line 82:
return accum;
}
 
#include <iostream>
using std::cout;
using std::endl;
 
int main (void)
{
Line 102:
int[] arg = { 1,2,3,4,5 };
int arg_length = arg.Length;
 
for( int i = 0; i < arg_length; i++ )
value += arg[i];
 
 
Line 111:
int sum = 0;
int[] arg = { 1, 2, 3, 4, 5 };
foreach (int value in arg) sum += value;
 
==[[Clean]]==
Line 128:
 
(defparameter *data* #(1 2 3 4 5))
(reduce #' + *data*)
 
==[[Delphi]]==
Line 141:
for i := 1 to length(ints) do inc(sum,ints[i]) ;
end;
 
==[[E]]==
[[Category:E]]
 
pragma.enable("accumulator")
accum 0 for x in [1,2,3,4,5] { _ + x }
 
==[[Erlang]]==
Line 155:
% create the list:
L = lists:seq(1, 10).
 
% and compute its sum:
S = lists:sum(L).
Line 163:
-module(list_sum).
-export([sum_rec/1, sum_tail/1]).
 
% recursive definition:
sum_rec([]) ->
Line 169:
sum_rec([Head|Tail]) ->
Head + sum_rec(Tail).
 
% tail-recursive definition:
sum_tail(L) ->
Line 183:
: sum ( addr cnt -- n )
0 -rot
cells bounds do i @ + cell +loop ;
 
 
Line 190:
 
dim array(4) as integer = { 1, 2, 3, 4, 5 }
 
dim sum as integer = 0
for index as integer = lbound(array) to ubound(array)
sum += array(index)
next
 
Line 201:
let values = [1..10]
sum values -- the easy way
foldl ( +) 0 values -- the hard way
 
==[[IDL]]==
Line 214:
int[] arg = new int[] { 1,2,3,4,5 };
for (int i: arg)
value += i;
 
==[[JavaScript]]==
Line 222:
var sum = 0;
for(var i in array)
sum += array[i];
 
==[[Perl]]==
Line 230:
my $var;
my @list = (1, 2, 3);
$var += $_ for (@list);
 
Alternate
Line 245:
my $acc = 0;
my @list = qw(1 2 3)
map { $acc += $_ } @list
 
==[[PHP]]==
Line 286:
 
ary = [1,2,3,4,5]
sum = ary.inject{|currentSum,element|currentSum +element}
# => 15
 
Line 292:
[[Category:Scala]]
val array = Array(1,2,3,4,5)
val sum = array.foldLeft(0)(_ + _)
 
This is a shortcut for
val sum = array.foldLeft(0){(currentSum, element) => currentSum + element}
 
==[[Seed7]]==
Line 307:
begin
for value range valueArray do
sum +:= value;
end for;
end func;
Line 319:
 
val array = [1,2,3,4,5];
foldl op + 0 array;
 
==[[Tcl]]==
Line 326:
Assuming the values are in a list named <tt>listname</tt>:
 
set result [expr [join $listname +]]
 
==[[Toka]]==
Line 344:
list="1 2 3"
for n in $list
do sum="$(($sum + $n))"
done
echo $sum
Line 352:
sum=0
for n
do sum="$(($sum + $n))"
done
echo $sum
Line 360:
sum=0
while read n
do sum="$(($sum + $n))"
done
echo $sum
Line 371:
SUM=0;
for i in $LIST; do
SUM=$[$SUM + $i];
done;
echo $SUM
Retrieved from "https://rosettacode.org/wiki/Sum_of_Array"