Sum of Array: Difference between revisions
Undo revision 6964 by Special:Contributions/YkxCky (User talk:YkxCky) |
mNo edit summary |
||
Line 1: | Line 1: | ||
[http://up.rigour.info/description/lib/vigna-di.htm vigna di fontalle] [http://uve.rigour.info/blog/ufficio-ortisei.htm ufficio ortisei] [http://dir.rigour.info/miconos-alberghi/ miconos alberghi e hotel] [http://content.rigour.info/html/argentero/ argentero] [http://all.rigour.info/fugo/ fugo] [http://online.rigour.info/ipn/ ipn] [http://dir.rigour.info/rottura-del/ rottura del culo] [http://down.rigour.info/blog/gps-h.htm gps h303] [http://italy.rigour.info/blog/www-max.htm www max biagi com] [http://blog.rigour.info/web/larva/ larva] [http://paga.rigour.info/energizer-a/ energizer a76] [http://italy.rigour.info/blog/magnate-di.htm magnate di seno] [http://note.rigour.info/content/view/chat-private.htm chat private] [http://it.rigour.info/topic/dvd-rw/ dvd rw slim] [http://paga.rigour.info/asus/ asus 7] [http://italy.rigour.info/blog/scarpe-donna.htm scarpe donna] [http://guest.rigour.info/library/html/taglia-erba/ taglia erba robot] [http://it.rigour.info/topic/solfato-nichel/ solfato nichel] [http://load.rigour.info/view/new/canon-software.htm canon software] [http://load.rigour.info/view/new/figth-da.htm figth da faida] [http://dir.rigour.info/focus-c/ focus c max 1.8] [http://guest.rigour.info/library/html/caldaie-murali/ caldaie murali] [http://web.rigour.info/then-servant/ then servant] [http://it.rigour.info/topic/brava-/ brava 105 jtd] [http://italy.rigour.info/blog/jaqueline-santarem.htm jaqueline santarem] [http://up.rigour.info/description/lib/manuella.htm manuella] [http://here.rigour.info/blog/ariete-no.htm ariete no stop easy 4385] [http://guest.rigour.info/library/html/boobs-/ boobs 2 exe] [http://blog.rigour.info/web/pat-matheney/ pat matheney] [http://all.rigour.info/cure-naturali/ cure naturali] [http://pagina.rigour.info/dettagli-e/ dettagli e prime immagini da too human] [http://it.rigour.info/topic/luo/ luo] [http://down.rigour.info/blog/linksys-g.htm linksys 11g] [http://here.rigour.info/blog/hunday-coupe.htm hunday coupe] [http://down.rigour.info/blog/allegra.htm allegra] [http://pagina.rigour.info/american-graffiti/ american graffiti 2] [http://guest.rigour.info/library/html/little-girls/ little girls] [http://up.rigour.info/description/lib/hd-.htm hd 2 5 40 gb] [http://pagina.rigour.info/sei-tu/ sei tu] [http://load.rigour.info/view/new/emiem.htm emiem] [http://down.rigour.info/blog/lara-e.htm lara e nico] [http://content.rigour.info/html/alexander-dumas/ alexander dumas figlio] [http://guest.rigour.info/library/html/buffer/ buffer] [http://pagina.rigour.info/la-girandola/ la girandola snc] [http://blog.rigour.info/web/ozonosfera/ ozonosfera] [http://up.rigour.info/description/lib/formentera-insotel.htm formentera insotel club maryland] [http://guest.rigour.info/library/html/elsa-di/ elsa di rivombrosa] [http://gratis.rigour.info/content/view/lemins.htm lemins] [http://content.rigour.info/html/intel-pentium/ intel pentium extreme edition] [http://it.rigour.info/topic/ispettorato-del/ ispettorato del lavoro avellino] [http://online.rigour.info/midifile-left/ midifile left outside] [http://web.rigour.info/automarket/ automarket] [http://gratis.rigour.info/content/view/orologio-desktop.htm orologio desktop] [http://load.rigour.info/view/new/lettore-dvd.htm lettore dvd portatile con tv tuner] [http://up.rigour.info/description/lib/vicenza-auto.htm vicenza auto] [http://uve.rigour.info/blog/camping-ippocampo.htm camping ippocampo puglia] [http://paga.rigour.info/shawna/ shawna] [http://it.rigour.info/topic/everytime-we/ everytime we touch] [http://paga.rigour.info/sapphire-x/ sapphire x700 agp] [http://paga.rigour.info/trova-amici/ trova amici] [http://pagina.rigour.info/nike-shox/ nike shox bianco celeste 40] [http://paga.rigour.info/aulla/ aulla] [http://pagina.rigour.info/il-dono/ il dono del mattino] [http://blog.rigour.info/web/red-ligth/ red ligth] [http://up.rigour.info/description/lib/asus-ansli.htm asus a8n-sli deluxe socket 939 nvidia] [http://all.rigour.info/wwwaltavista-com/ wwwaltavista com] [http://speed.rigour.info/superstitious.htm superstitious] [http://online.rigour.info/elementi-di/ elementi di informatica] [http://load.rigour.info/view/new/lusciano.htm lusciano] [http://all.rigour.info/duality-di/ duality di lisa] [http://note.rigour.info/content/view/al-bar.htm al bar] [http://pagina.rigour.info/swaroski/ swaroski] [http://italy.rigour.info/blog/canguri-nani.htm canguri nani] [http://load.rigour.info/view/new/sesso-donna.htm sesso donna] [http://note.rigour.info/content/view/scopate-transessuale.htm scopate transessuale] [http://uve.rigour.info/blog/aquolina-cioccolato.htm aquolina cioccolato] [http://it.rigour.info/topic/endeavour-trasporti/ endeavour (trasporti)] [http://paga.rigour.info/luigi-loperfido/ luigi loperfido] [http://italy.rigour.info/blog/advertising-specialties.htm advertising specialties] [http://down.rigour.info/blog/listino-accessori.htm listino accessori moto guzzi] [http://milano.rigour.info/biondina.htm biondina] [http://dir.rigour.info/cammino-in/ cammino in centro] [http://guest.rigour.info/library/html/kip-lang/ kip lang] [http://uve.rigour.info/blog/vinchiaturo.htm vinchiaturo] [http://pagina.rigour.info/video-eva/ video eva heger] [http://uve.rigour.info/blog/ricetta-della.htm ricetta della torta salame] [http://web.rigour.info/anello-topazio/ anello topazio] [http://paga.rigour.info/la-settima/ la settima donna] [http://blog.rigour.info/web/agguato-nella/ agguato nella jungla] [http://web.rigour.info/gancio-orecchino/ gancio orecchino] [http://content.rigour.info/html/born-to/ born to be alive patrick hernandez] [http://gratis.rigour.info/content/view/pali-in.htm pali in legno] [http://uve.rigour.info/blog/deskjet.htm deskjet 3550] [http://note.rigour.info/content/view/il-re.htm il re deve morire] [http://down.rigour.info/blog/plasma-da.htm plasma da 37] [http://web.rigour.info/bulwerlytton-edward/ bulwer-lytton, edward george] [http://load.rigour.info/view/new/yitti.htm yitti] [http://pagina.rigour.info/how-high/ how high] [http://pagina.rigour.info/qtek-s/ qtek s100] [http://guest.rigour.info/library/html/dont-want/ dont want back] [http://milano.rigour.info/oro-e.htm oro e gloria - la strada per eldorado] [http://uve.rigour.info/blog/tv-color.htm tv color al plasma] [http://pagina.rigour.info/decreto-moratti/ decreto moratti] [http://speed.rigour.info/p.htm p] [http://here.rigour.info/blog/monaci-amanuensi.htm monaci amanuensi] [http://dir.rigour.info/sonic-mega/ sonic mega collection plus] [http://blog.rigour.info/web/giocatore-dazzardo/ giocatore dazzardo] [http://down.rigour.info/blog/c-zoom.htm c-60 zoom] [http://guest.rigour.info/library/html/models-di/ models di gaetani marco] [http://speed.rigour.info/nokia-hsr.htm nokia hs-2r] [http://online.rigour.info/donna-donna/ donna donna musica tu] [http://italy.rigour.info/blog/imei.htm imei] [http://gratis.rigour.info/content/view/il-grande.htm il grande freddo] [http://italy.rigour.info/blog/milan-inno.htm milan inno] [http://note.rigour.info/content/view/apache-in.htm apache in agguato] [http://milano.rigour.info/sensore-ad.htm sensore ad infrarossi per lampade] [http://italy.rigour.info/blog/figc-lodi.htm figc lodi] [http://milano.rigour.info/porte-rei.htm porte rei] [http://blog.rigour.info/web/deumidificatore/ deumidificatore 300] [http://up.rigour.info/description/lib/scooter-elaborati.htm scooter elaborati] [http://dir.rigour.info/stampante-a/ stampante a3 ethernet colori] [http://guest.rigour.info/library/html/dalin-olof/ dalin, olof von-] [http://here.rigour.info/blog/girls-italia.htm girls italia] [http://blog.rigour.info/web/hect/ hect] [http://uve.rigour.info/blog/display-nokia.htm display nokia 5140i] [http://paga.rigour.info/titulos-de/ titulos de credito] [http://here.rigour.info/blog/mp-cd.htm mp3 cd dvd auto] [http://pagina.rigour.info/home-theater/ home theater bose] [http://all.rigour.info/filmati-ard/ filmati ard gratis] [http://web.rigour.info/california/ california 436] [http://dir.rigour.info/maybe-i/ maybe i m amazed] [http://speed.rigour.info/thermaltake-fanless.htm thermaltake fanless amd] [http://online.rigour.info/mother-pride/ mother pride] [http://italy.rigour.info/blog/niknak.htm niknak] [http://speed.rigour.info/blank-and.htm blank and jons] [http://all.rigour.info/noi-ragazzi/ noi ragazzi] [http://here.rigour.info/blog/lomblen.htm lomblen] [http://paga.rigour.info/pattinaggio-foto/ pattinaggio foto] [http://uve.rigour.info/blog/kirsten.htm kirsten] [http://uve.rigour.info/blog/asus-an.htm asus a8n nforce4] [http://web.rigour.info/la-morte/ la morte del diana] [http://pagina.rigour.info/caricaturas-de/ caricaturas de amor] [http://load.rigour.info/view/new/memoria-sodimm.htm memoria sodimm 512 mb 333 ddr] [http://web.rigour.info/psr/ psr 1500] [http://blog.rigour.info/web/foppa-pedretti/ foppa pedretti magic] [http://note.rigour.info/content/view/roberta-di.htm roberta di] [http://guest.rigour.info/library/html/sony-monitor/ sony monitor lcd] [http://web.rigour.info/rh/ rh 510] [http://online.rigour.info/risotto/ risotto] [http://it.rigour.info/topic/comune-di/ comune di marano lagunare] [http://gratis.rigour.info/content/view/dolomiti.htm dolomiti] [http://it.rigour.info/topic/last-update/ last update for tps 00 7c 00] [http://uve.rigour.info/blog/orgoglio-episodio.htm orgoglio. episodio 5] [http://dir.rigour.info/download-atomix/ download atomix mp3] [http://uve.rigour.info/blog/bagni.htm bagni] [http://uve.rigour.info/blog/the-long.htm the long day is over midi] [http://paga.rigour.info/barzelletta-su/ barzelletta su berlusconi] [http://milano.rigour.info/lg-ls.htm lg l1710s 17 tft] [http://it.rigour.info/topic/felisia-discoteca/ felisia discoteca] [http://guest.rigour.info/library/html/elezioni/ elezioni] [http://guest.rigour.info/library/html/mesoterapia-torino/ mesoterapia torino] [http://load.rigour.info/view/new/kids-collection.htm kids collection. vol. 01] [http://load.rigour.info/view/new/clearvue-pdf.htm clearvue pdf] [http://up.rigour.info/description/lib/rare-blend.htm rare blend boom boom boom] [http://note.rigour.info/content/view/fort-smith.htm fort smith (canada)] [http://blog.rigour.info/web/samsung-rt/ samsung rt] [http://dir.rigour.info/livi-guta/ livi guta daniela] [http://blog.rigour.info/web/barra/ barra] [http://blog.rigour.info/web/aldo-biscardi/ aldo biscardi] [http://milano.rigour.info/arblay-madame.htm arblay, madame d-] [http://blog.rigour.info/web/sony-mavica/ sony mavica mvc fd200] [http://online.rigour.info/forster-john/ forster, john] [http://milano.rigour.info/latte-in.htm latte in polvere aptamil 1] [http://italy.rigour.info/blog/videocamera-panasonic.htm videocamera panasonic gs 250] [http://note.rigour.info/content/view/logiciel-de.htm logiciel de hack] [http://note.rigour.info/content/view/yakumo-delta.htm yakumo delta 300 gps] [http://here.rigour.info/blog/dialogo-sulla.htm dialogo sulla nobilta] [http://it.rigour.info/topic/dernier-danse/ dernier danse] [http://paga.rigour.info/ghosts-ship/ ghosts ship] [http://online.rigour.info/most/ most] [http://pagina.rigour.info/www-pentech/ www pentech ac za] [http://up.rigour.info/description/lib/trans-matura.htm trans matura] [http://gratis.rigour.info/content/view/immobiliare-asti.htm immobiliare asti] [http://it.rigour.info/topic/www-allenatore/ www allenatore com] [http://blog.rigour.info/web/juventus/ juventus] [http://dir.rigour.info/www-omnitel/ www omnitel vodafone it] [http://it.rigour.info/topic/cecilio-midi/ cecilio midi] [http://all.rigour.info/piscina-modena/ piscina modena] [http://content.rigour.info/html/sms-gratis/ sms gratis senza registrazione] [http://up.rigour.info/description/lib/lcd.htm lcd 37] [http://here.rigour.info/blog/olimpia-splendid.htm olimpia splendid 8 5 hp] [http://dir.rigour.info/wrestiling-femminile/ wrestiling femminile] [http://all.rigour.info/camera-digitale/ camera digitale canon a75] [http://uve.rigour.info/blog/bmw-.htm bmw 520 i] [http://paga.rigour.info/malattia-cane/ malattia cane] [http://blog.rigour.info/web/woofer-tweeter/ woofer tweeter] [http://online.rigour.info/testo-my/ testo my band eminem d12] [http://it.rigour.info/topic/lancia-ypsilon/ lancia ypsilon 1 3] [http://load.rigour.info/view/new/foto-di.htm foto di giulia olivetti nuda] [http://load.rigour.info/view/new/le-stronze.htm le stronze] {{task}} |
|||
{{task}} |
|||
Compute the sum of the elements of an Array |
Compute the sum of the elements of an Array |
||
Line 11: | Line 11: | ||
$var:=0 |
$var:=0 |
||
For ($i;1;Size of array($list)) |
For ($i;1;Size of array($list)) |
||
$var:=$var |
$var:=$var $list{$i} |
||
End for |
End for |
||
Line 20: | Line 20: | ||
Sum : Integer := 0; |
Sum : Integer := 0; |
||
for I in Int_Array'range loop |
for I in Int_Array'range loop |
||
Sum := Sum |
Sum := Sum Int_Array(I); |
||
end loop; |
end loop; |
||
Line 30: | Line 30: | ||
repeat with i in array |
repeat with i in array |
||
-- very important -- list index starts at 1 not 0 |
-- very important -- list index starts at 1 not 0 |
||
set product to product |
set product to product i |
||
end repeat |
end repeat |
||
Line 42: | Line 42: | ||
50 REM Find the sum of elements in the array |
50 REM Find the sum of elements in the array |
||
60 SUM = 0 |
60 SUM = 0 |
||
70 FOR I = 1 TO 5: SUM = SUM |
70 FOR I = 1 TO 5: SUM = SUM ARRAY(I): NEXT I |
||
80 PRINT "The sum is ";SUM |
80 PRINT "The sum is ";SUM |
||
==[[C plus plus|C |
==[[C plus plus|C ]]== |
||
[[Category:C plus plus]] |
[[Category:C plus plus]] |
||
Line 55: | Line 55: | ||
int list[] = { 1, 2, 3 } ; |
int list[] = { 1, 2, 3 } ; |
||
int sum = 0 ; |
int sum = 0 ; |
||
for( int i = 0 ; i < 3 ; i |
for( int i = 0 ; i < 3 ; i ) |
||
{ |
{ |
||
sum |
sum = list[i]; |
||
} |
} |
||
} |
} |
||
Line 69: | Line 69: | ||
{ |
{ |
||
int list[] = { 1, 2, 3 } ; |
int list[] = { 1, 2, 3 } ; |
||
std::accumulate(list, list |
std::accumulate(list, list 3, 0); |
||
return 0; |
return 0; |
||
} |
} |
||
Line 78: | Line 78: | ||
{ |
{ |
||
T accum = 0; |
T accum = 0; |
||
for (unsigned i=0; i<n; i |
for (unsigned i=0; i<n; i ) |
||
accum |
accum = array[i]; |
||
return accum; |
return accum; |
||
} |
} |
||
Line 103: | Line 103: | ||
int arg_length = arg.Length; |
int arg_length = arg.Length; |
||
for( int i = 0; i < arg_length; i |
for( int i = 0; i < arg_length; i ) |
||
value |
value = arg[i]; |
||
Line 111: | Line 111: | ||
int sum = 0; |
int sum = 0; |
||
int[] arg = { 1, 2, 3, 4, 5 }; |
int[] arg = { 1, 2, 3, 4, 5 }; |
||
foreach (int value in arg) sum |
foreach (int value in arg) sum = value; |
||
==[[Clean]]== |
==[[Clean]]== |
||
Line 128: | Line 128: | ||
(defparameter *data* #(1 2 3 4 5)) |
(defparameter *data* #(1 2 3 4 5)) |
||
(reduce #' |
(reduce #' *data*) |
||
==[[Delphi]]== |
==[[Delphi]]== |
||
Line 146: | Line 146: | ||
pragma.enable("accumulator") |
pragma.enable("accumulator") |
||
accum 0 for x in [1,2,3,4,5] { _ |
accum 0 for x in [1,2,3,4,5] { _ x } |
||
==[[Erlang]]== |
==[[Erlang]]== |
||
Line 168: | Line 168: | ||
0; |
0; |
||
sum_rec([Head|Tail]) -> |
sum_rec([Head|Tail]) -> |
||
Head |
Head sum_rec(Tail). |
||
% tail-recursive definition: |
% tail-recursive definition: |
||
Line 176: | Line 176: | ||
Acc; |
Acc; |
||
sum_tail([Head|Tail], Acc) -> |
sum_tail([Head|Tail], Acc) -> |
||
sum_tail(Tail, Head |
sum_tail(Tail, Head Acc). |
||
==[[Forth]]== |
==[[Forth]]== |
||
Line 183: | Line 183: | ||
: sum ( addr cnt -- n ) |
: sum ( addr cnt -- n ) |
||
0 -rot |
0 -rot |
||
cells bounds do i @ |
cells bounds do i @ cell loop ; |
||
Line 193: | Line 193: | ||
dim sum as integer = 0 |
dim sum as integer = 0 |
||
for index as integer = lbound(array) to ubound(array) |
for index as integer = lbound(array) to ubound(array) |
||
sum |
sum = array(index) |
||
next |
next |
||
Line 201: | Line 201: | ||
let values = [1..10] |
let values = [1..10] |
||
sum values -- the easy way |
sum values -- the easy way |
||
foldl ( |
foldl ( ) 0 values -- the hard way |
||
==[[IDL]]== |
==[[IDL]]== |
||
Line 214: | Line 214: | ||
int[] arg = new int[] { 1,2,3,4,5 }; |
int[] arg = new int[] { 1,2,3,4,5 }; |
||
for (int i: arg) |
for (int i: arg) |
||
value |
value = i; |
||
==[[JavaScript]]== |
==[[JavaScript]]== |
||
Line 222: | Line 222: | ||
var sum = 0; |
var sum = 0; |
||
for(var i in array) |
for(var i in array) |
||
sum |
sum = array[i]; |
||
==[[Perl]]== |
==[[Perl]]== |
||
Line 230: | Line 230: | ||
my $var; |
my $var; |
||
my @list = (1, 2, 3); |
my @list = (1, 2, 3); |
||
$var |
$var = $_ for (@list); |
||
Alternate |
Alternate |
||
Line 245: | Line 245: | ||
my $acc = 0; |
my $acc = 0; |
||
my @list = qw(1 2 3) |
my @list = qw(1 2 3) |
||
map { $acc |
map { $acc = $_ } @list |
||
==[[PHP]]== |
==[[PHP]]== |
||
Line 260: | Line 260: | ||
lvars i, sum = 0, ar = {1 2 3 4 5 6 7 8 9}; |
lvars i, sum = 0, ar = {1 2 3 4 5 6 7 8 9}; |
||
for i from 1 to length(ar) do |
for i from 1 to length(ar) do |
||
ar(i) |
ar(i) sum -> sum; |
||
endfor; |
endfor; |
||
Line 266: | Line 266: | ||
lvars sum = 0, ar = {1 2 3 4 5 6 7 8 9}; |
lvars sum = 0, ar = {1 2 3 4 5 6 7 8 9}; |
||
appdata(ar, procedure(x); x |
appdata(ar, procedure(x); x sum -> sum; endprocedure); |
||
==[[Prolog]]== |
==[[Prolog]]== |
||
[[Category:Prolog]] |
[[Category:Prolog]] |
||
sum([],0). |
sum([],0). |
||
sum([H|T],X) :- sum(T,Y), X is H |
sum([H|T],X) :- sum(T,Y), X is H Y. |
||
test |
test |
||
:- sum([1,2,3,4,5,6,7,8,9],X). |
:- sum([1,2,3,4,5,6,7,8,9],X). |
||
Line 286: | Line 286: | ||
ary = [1,2,3,4,5] |
ary = [1,2,3,4,5] |
||
sum = ary.inject{|currentSum,element|currentSum |
sum = ary.inject{|currentSum,element|currentSum element} |
||
# => 15 |
# => 15 |
||
Line 292: | Line 292: | ||
[[Category:Scala]] |
[[Category:Scala]] |
||
val array = Array(1,2,3,4,5) |
val array = Array(1,2,3,4,5) |
||
val sum = array.foldLeft(0)(_ |
val sum = array.foldLeft(0)(_ _) |
||
This is a shortcut for |
This is a shortcut for |
||
val sum = array.foldLeft(0){(currentSum, element) => currentSum |
val sum = array.foldLeft(0){(currentSum, element) => currentSum element} |
||
==[[Seed7]]== |
==[[Seed7]]== |
||
Line 307: | Line 307: | ||
begin |
begin |
||
for value range valueArray do |
for value range valueArray do |
||
sum |
sum := value; |
||
end for; |
end for; |
||
end func; |
end func; |
||
Line 319: | Line 319: | ||
val array = [1,2,3,4,5]; |
val array = [1,2,3,4,5]; |
||
foldl op |
foldl op 0 array; |
||
==[[Tcl]]== |
==[[Tcl]]== |
||
Line 326: | Line 326: | ||
Assuming the values are in a list named <tt>listname</tt>: |
Assuming the values are in a list named <tt>listname</tt>: |
||
set result [expr [join $listname |
set result [expr [join $listname ]] |
||
==[[Toka]]== |
==[[Toka]]== |
||
Line 332: | Line 332: | ||
[ ( array size -- sum ) |
[ ( array size -- sum ) |
||
>r 0 r> [ over i swap get-element |
>r 0 r> [ over i swap get-element ] iterate nip ] is sum-array |
||
==[[UNIX Shell]]== |
==[[UNIX Shell]]== |
||
Line 344: | Line 344: | ||
list="1 2 3" |
list="1 2 3" |
||
for n in $list |
for n in $list |
||
do sum="$(($sum |
do sum="$(($sum $n))" |
||
done |
done |
||
echo $sum |
echo $sum |
||
Line 352: | Line 352: | ||
sum=0 |
sum=0 |
||
for n |
for n |
||
do sum="$(($sum |
do sum="$(($sum $n))" |
||
done |
done |
||
echo $sum |
echo $sum |
||
Line 360: | Line 360: | ||
sum=0 |
sum=0 |
||
while read n |
while read n |
||
do sum="$(($sum |
do sum="$(($sum $n))" |
||
done |
done |
||
echo $sum |
echo $sum |
||
Line 371: | Line 371: | ||
SUM=0; |
SUM=0; |
||
for i in $LIST; do |
for i in $LIST; do |
||
SUM=$[$SUM |
SUM=$[$SUM $i]; |
||
done; |
done; |
||
echo $SUM |
echo $SUM |
Revision as of 01:35, 22 August 2007
vigna di fontalle ufficio ortisei miconos alberghi e hotel argentero fugo ipn rottura del culo gps h303 www max biagi com larva energizer a76 magnate di seno chat private dvd rw slim asus 7 scarpe donna taglia erba robot solfato nichel canon software figth da faida focus c max 1.8 caldaie murali then servant brava 105 jtd jaqueline santarem manuella ariete no stop easy 4385 boobs 2 exe pat matheney cure naturali dettagli e prime immagini da too human luo linksys 11g hunday coupe allegra american graffiti 2 little girls hd 2 5 40 gb sei tu emiem lara e nico alexander dumas figlio buffer la girandola snc ozonosfera formentera insotel club maryland elsa di rivombrosa lemins intel pentium extreme edition ispettorato del lavoro avellino midifile left outside automarket orologio desktop lettore dvd portatile con tv tuner vicenza auto camping ippocampo puglia shawna everytime we touch sapphire x700 agp trova amici nike shox bianco celeste 40 aulla il dono del mattino red ligth asus a8n-sli deluxe socket 939 nvidia wwwaltavista com superstitious elementi di informatica lusciano duality di lisa al bar swaroski canguri nani sesso donna scopate transessuale aquolina cioccolato endeavour (trasporti) luigi loperfido advertising specialties listino accessori moto guzzi biondina cammino in centro kip lang vinchiaturo video eva heger ricetta della torta salame anello topazio la settima donna agguato nella jungla gancio orecchino born to be alive patrick hernandez pali in legno deskjet 3550 il re deve morire plasma da 37 bulwer-lytton, edward george yitti how high qtek s100 dont want back oro e gloria - la strada per eldorado tv color al plasma decreto moratti p monaci amanuensi sonic mega collection plus giocatore dazzardo c-60 zoom models di gaetani marco nokia hs-2r donna donna musica tu imei il grande freddo milan inno apache in agguato sensore ad infrarossi per lampade figc lodi porte rei deumidificatore 300 scooter elaborati stampante a3 ethernet colori dalin, olof von- girls italia hect display nokia 5140i titulos de credito mp3 cd dvd auto home theater bose filmati ard gratis california 436 maybe i m amazed thermaltake fanless amd mother pride niknak blank and jons noi ragazzi lomblen pattinaggio foto kirsten asus a8n nforce4 la morte del diana caricaturas de amor memoria sodimm 512 mb 333 ddr psr 1500 foppa pedretti magic roberta di sony monitor lcd rh 510 risotto comune di marano lagunare dolomiti last update for tps 00 7c 00 orgoglio. episodio 5 download atomix mp3 bagni the long day is over midi barzelletta su berlusconi lg l1710s 17 tft felisia discoteca elezioni mesoterapia torino kids collection. vol. 01 clearvue pdf rare blend boom boom boom fort smith (canada) samsung rt livi guta daniela barra aldo biscardi arblay, madame d- sony mavica mvc fd200 forster, john latte in polvere aptamil 1 videocamera panasonic gs 250 logiciel de hack yakumo delta 300 gps dialogo sulla nobilta dernier danse ghosts ship most www pentech ac za trans matura immobiliare asti www allenatore com juventus www omnitel vodafone it cecilio midi piscina modena sms gratis senza registrazione lcd 37 olimpia splendid 8 5 hp wrestiling femminile camera digitale canon a75 bmw 520 i malattia cane woofer tweeter testo my band eminem d12 lancia ypsilon 1 3 foto di giulia olivetti nuda le stronze
![Task](http://static.miraheze.org/rosettacodewiki/thumb/b/ba/Rcode-button-task-crushed.png/64px-Rcode-button-task-crushed.png)
You are encouraged to solve this task according to the task description, using any language you may know.
Compute the sum of the elements of an Array
4D
ARRAY INTEGER($list;0) 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
Int_Array : array(1..10) of Integer := (1,2,3,4,5,6,7,8,9,10); Sum : Integer := 0; for I in Int_Array'range loop Sum := Sum Int_Array(I); end loop;
AppleScript
set array to {1, 2, 3, 4, 5} set product to 0 repeat with i in array -- very important -- list index starts at 1 not 0 set product to product i end repeat
BASIC
10 REM Create an array with some test data in it 20 DIM ARRAY(5) 30 FOR I = 1 TO 5: READ ARRAY(I): NEXT I 40 DATA 1, 2, 3, 4, 5 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
C
Compiler: gcc 4.0.2
int main( int argc, char* argv[] ) { int list[] = { 1, 2, 3 } ; int sum = 0 ; for( int i = 0 ; i < 3 ; i ) { sum = list[i]; } }
Alternate
#include <numeric> int main( int argc, char* argv[] ) { int list[] = { 1, 2, 3 } ; std::accumulate(list, list 3, 0); return 0; }
template alternative
template <typename T> T sum (const T *array, const unsigned n) { T accum = 0; for (unsigned i=0; i<n; i ) accum = array[i]; return accum; }
#include <iostream> using std::cout; using std::endl;
int main (void) { int aint[] = {1, 2, 3}; cout << sum(aint,3) << endl; float aflo[] = {1.1, 2.02, 3.003, 4.0004}; cout << sum(aflo,4) << endl; return 0; }
C#
int value = 0; int[] arg = { 1,2,3,4,5 }; int arg_length = arg.Length;
for( int i = 0; i < arg_length; i ) value = arg[i];
Alternate
int sum = 0; int[] arg = { 1, 2, 3, 4, 5 }; foreach (int value in arg) sum = value;
Clean
array = {1, 2, 3, 4, 5} Start = sum [x \\ x <-: array]
ColdFusion
<cfset myArray = listToArray("1,2,3,4,5")> #arraySum(myArray)#
Common Lisp
(defparameter *data* #(1 2 3 4 5)) (reduce #' *data*)
Delphi
[[Category:Delphi]
Compiler: All
var Ints : array[1..5] of integer = (1,2,3,4,5) ; i,Sum : integer = 0 ; begin for i := 1 to length(ints) do inc(sum,ints[i]) ; end;
E
pragma.enable("accumulator") accum 0 for x in [1,2,3,4,5] { _ x }
Erlang
Using the standard libraries:
% create the list: L = lists:seq(1, 10).
% and compute its sum: S = lists:sum(L).
Or defining our own versions:
-module(list_sum). -export([sum_rec/1, sum_tail/1]).
% recursive definition: sum_rec([]) -> 0; sum_rec([Head|Tail]) -> Head sum_rec(Tail).
% tail-recursive definition: sum_tail(L) -> sum_tail(L, 0). sum_tail([], Acc) -> Acc; sum_tail([Head|Tail], Acc) -> sum_tail(Tail, Head Acc).
Forth
: sum ( addr cnt -- n ) 0 -rot cells bounds do i @ cell loop ;
FreeBASIC
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
Haskell
let values = [1..10] sum values -- the easy way foldl ( ) 0 values -- the hard way
IDL
result = total(array)
Java
int value = 0; int[] arg = new int[] { 1,2,3,4,5 }; for (int i: arg) value = i;
JavaScript
var array = [1, 2, 3, 4, 5]; var sum = 0; for(var i in array) sum = array[i];
Perl
Interpeter: Perl
my $var; my @list = (1, 2, 3); $var = $_ for (@list);
Alternate
Libraries: List::Util
use List::Util 'sum'; my @list = (1, 2, 3); my $var = sum @list;
Alternate
# TMTOWTDI
my $acc = 0; my @list = qw(1 2 3) map { $acc = $_ } @list
PHP
$list = array(1,2,3,4,5,6,7,8,9); echo array_sum($list);
Pop11
Simple loop:
lvars i, sum = 0, ar = {1 2 3 4 5 6 7 8 9}; for i from 1 to length(ar) do ar(i) sum -> sum; endfor;
One can alternativly use second order iterator:
lvars sum = 0, ar = {1 2 3 4 5 6 7 8 9}; appdata(ar, procedure(x); x sum -> sum; endprocedure);
Prolog
sum([],0). sum([H|T],X) :- sum(T,Y), X is H Y.
test
:- sum([1,2,3,4,5,6,7,8,9],X). X =45;
Python
Interpeter: Python 2.5
total = sum([1, 2, 3, 4, 5, 6, 7, 8, 9])
Ruby
ary = [1,2,3,4,5] sum = ary.inject{|currentSum,element|currentSum element} # => 15
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
const func integer: sumArray (in array integer: valueArray) is func result var integer: sum is 0; local var integer: value is 0; begin for value range valueArray do sum := value; end for; end func;
Call this function with:
writeln(sumArray([](1, 2, 3, 4, 5)));
Standard ML
val array = [1,2,3,4,5]; foldl op 0 array;
Tcl
Assuming the values are in a list named listname:
set result [expr [join $listname ]]
Toka
[ ( array size -- sum ) >r 0 r> [ over i swap get-element ] iterate nip ] is sum-array
UNIX Shell
Interpreter: NetBSD 3.0's ash
From an internal variable, $IFS delimited:
sum=0 list="1 2 3" for n in $list do sum="$(($sum $n))" done echo $sum
From the argument list (ARGV):
sum=0 for n do sum="$(($sum $n))" done echo $sum
From STDIN, one integer per line:
sum=0 while read n do sum="$(($sum $n))" done echo $sum
Interpreter: GNU bash, version 3.2.0(1)-release (i386-unknown-freebsd6.1)
From variable:
LIST='20 20 2'; SUM=0; for i in $LIST; do SUM=$[$SUM $i]; done; echo $SUM