Anonymous user
Sum of Array: Difference between revisions
Undo revision 8091 by Special:Contributions/LpvHw9 (User talk:LpvHw9)
mNo edit summary |
(Undo revision 8091 by Special:Contributions/LpvHw9 (User talk:LpvHw9)) |
||
Line 1:
{{task}}
Compute the sum of the elements of an Array
Line 11:
$var:=0
For ($i;1;Size of array($list))
$var:=$var
End for
Line 20:
Sum : Integer := 0;
for I in Int_Array'range loop
Sum := Sum
end loop;
Line 30:
repeat with i in array
-- very important -- list index starts at 1 not 0
set product to product
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
80 PRINT "The sum is ";SUM
==[[C plus plus|C
[[Category:C plus plus]]
Line 55:
int list[] = { 1, 2, 3 } ;
int sum = 0 ;
for( int i = 0 ; i < 3 ; i
{
sum
}
}
Line 69:
{
int list[] = { 1, 2, 3 } ;
std::accumulate(list, list
return 0;
}
Line 78:
{
T accum = 0;
for (unsigned i=0; i<n; i
accum
return accum;
}
Line 103:
int arg_length = arg.Length;
for( int i = 0; i < arg_length; i
value
Line 111:
int sum = 0;
int[] arg = { 1, 2, 3, 4, 5 };
foreach (int value in arg) sum
==[[Clean]]==
Line 128:
(defparameter *data* #(1 2 3 4 5))
(reduce #'
==[[Delphi]]==
Line 146:
pragma.enable("accumulator")
accum 0 for x in [1,2,3,4,5] { _
==[[Erlang]]==
Line 168:
0;
sum_rec([Head|Tail]) ->
Head
% tail-recursive definition:
Line 176:
Acc;
sum_tail([Head|Tail], Acc) ->
sum_tail(Tail, Head
==[[Forth]]==
Line 183:
: sum ( addr cnt -- n )
0 -rot
cells bounds do i @
Line 193:
dim sum as integer = 0
for index as integer = lbound(array) to ubound(array)
sum
next
Line 201:
let values = [1..10]
sum values -- the easy way
foldl (
==[[IDL]]==
Line 214:
int[] arg = new int[] { 1,2,3,4,5 };
for (int i: arg)
value
==[[JavaScript]]==
Line 222:
var sum = 0;
for(var i in array)
sum
==[[Perl]]==
Line 230:
my $var;
my @list = (1, 2, 3);
$var
Alternate
Line 245:
my $acc = 0;
my @list = qw(1 2 3)
map { $acc
==[[PHP]]==
Line 260:
lvars i, sum = 0, ar = {1 2 3 4 5 6 7 8 9};
for i from 1 to length(ar) do
ar(i)
endfor;
Line 266:
lvars sum = 0, ar = {1 2 3 4 5 6 7 8 9};
appdata(ar, procedure(x); x
==[[Prolog]]==
[[Category:Prolog]]
sum([],0).
sum([H|T],X) :- sum(T,Y), X is H
test
:- sum([1,2,3,4,5,6,7,8,9],X).
Line 286:
ary = [1,2,3,4,5]
sum = ary.inject{|currentSum,element|currentSum
# => 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
==[[Seed7]]==
Line 307:
begin
for value range valueArray do
sum
end for;
end func;
Line 319:
val array = [1,2,3,4,5];
foldl op
==[[Tcl]]==
Line 326:
Assuming the values are in a list named <tt>listname</tt>:
set result [expr [join $listname
==[[Toka]]==
Line 332:
[ ( array size -- sum )
>r 0 r> [ over i swap get-element
==[[UNIX Shell]]==
Line 344:
list="1 2 3"
for n in $list
do sum="$(($sum
done
echo $sum
Line 352:
sum=0
for n
do sum="$(($sum
done
echo $sum
Line 360:
sum=0
while read n
do sum="$(($sum
done
echo $sum
Line 371:
SUM=0;
for i in $LIST; do
SUM=$[$SUM
done;
echo $SUM
| |||