Difference between revisions of "Calculate the sum over a container"

From CodeCodex

(Implementations)
(Haskell)
 
(41 intermediate revisions by 24 users not shown)
Line 3: Line 3:
  
 
==See also==
 
==See also==
* [[Perform simple mathmatical operations on two matrices]]
+
* [[Perform simple mathematical operations on two matrices]]
 
* [[:Category:Arrays]]
 
* [[:Category:Arrays]]
  
 
==Implementations==
 
==Implementations==
===C===
+
 
Total of a series function. Terminate by using INT_MAX
+
===Algol 68===
 +
 
 +
The following function computes the sum of the elements of the array passed to it. The type of the array elements is called <TT>NUM</TT>, which can be defined as any suitable integer or real type.
 +
 
 
<pre>
 
<pre>
//stdarg.h must be included for this type of function to be declared
+
MODE NUM = INT; # type of array element #
#include <stdarg.h>
+
  
int total( int first, ... ) {
+
PROC sum = ([] NUM a) NUM :
  int count = 0, sum = 0, i = first;
+
    BEGIN
  va_list marker;
+
        NUM result := 0;
 
+
        FOR i FROM LWB a TO UPB a DO
  va_start( marker, first );    /* Initialize variable arguments. */
+
            result +:= a[i]
  while( i != INT_MAX )
+
        OD;
  {
+
        result
      sum += i;                  //increases the sum
+
    END
      i = va_arg( marker, int);   //Gets the next argument
+
  }
+
  va_end( marker );              // Resets the list
+
  return sum;
+
}
+
 
</pre>
 
</pre>
  
===C++===
+
For instance, the call
 +
 
 
<pre>
 
<pre>
sum = accumulate(coll.begin(),coll.end(),0);
+
sum((3, 4, 5, 6))
 
</pre>
 
</pre>
 +
returns 18.
  
 
===Assembly===
 
===Assembly===
Line 50: Line 49:
 
</pre>
 
</pre>
  
 +
===C===
 +
<pre class="c">
 +
int total( int numbers[], int size ) {
 +
  int sum = 0, i;
 +
  for ( i = 0 ; i < size ; i++ )
 +
  {
 +
      sum += numbers[i];
 +
  }
 +
  return sum;
 +
}
 +
</pre>
  
===Java===
+
===C++===
 +
<pre class="cpp">
 +
#include<numeric>
 +
 
 +
sum = std::accumulate(coll.begin(),coll.end(),0);
 +
</pre>
 +
 
 +
===Common Lisp===
 +
<pre class="lisp">
 +
(reduce #'+ list)
 +
(reduce #'+ list :initial-value 0) ; improved version that also works with empty lists
 +
</pre>
 +
 
 +
Another way:
 +
 
 +
<pre class="lisp">
 +
(apply #'+ list)
 +
</pre>
 +
 
 +
===Erlang===
 
<pre>
 
<pre>
 +
lists:sum(List).
 +
</pre>
 +
 +
===Excel===
 +
<pre>
 +
=SUM([cells])
 +
</pre>
 +
 +
===F#===
 +
<pre class="fsharp">
 +
Seq.sum container
 +
</pre>
 +
 +
===Haskell===
 +
<pre class="haskell">
 +
sum container
 +
</pre>
 +
For example:
 +
<pre>
 +
Prelude> sum [1, 2, 3, 4]
 +
10
 +
</pre>
 +
 +
===Java===
 +
<pre class="java">
 
import java.util.*;
 
import java.util.*;
  
Line 81: Line 135:
 
# sum [1; 2; 4; 40];;
 
# sum [1; 2; 4; 40];;
 
- : int = 47
 
- : int = 47
 +
</pre>
 +
 +
===Perl===
 +
<pre class="perl">
 +
use List::Util qw(sum);
 +
sum @arr;
 +
sum 0, @arr; # improved version that also works with empty arrays
 
</pre>
 
</pre>
  
 
===Python===
 
===Python===
 
A function that sums the values in a sequence is built into python, its name is 'sum'.
 
A function that sums the values in a sequence is built into python, its name is 'sum'.
<pre>
+
<pre class="python">
if __name__ == '__main__':
+
assert sum([1,2,3]) == 6
  assert sum([1,2,3]) == 6
+
 
</pre>
 
</pre>
A parallel to the ANSI C example given above is as follows:
 
<pre>
 
import itertools
 
def total(*values):
 
  return sum(itertools.takewhile(sys.maxint.__cmp__, values))
 
  
if __name__ == '__main__':
+
===Ruby===
   assert total(1,2,3,sys.maxint) == 6
+
<pre class="ruby">
 +
class Array
 +
   def sum
 +
    inject { |s, v| s += v }
 +
  end
 +
end
 +
</pre>
 +
Or more concisely,  
 +
<pre class="ruby">
 +
class Array
 +
  def sum
 +
    reduce(:+)
 +
  end
 +
end
 
</pre>
 
</pre>
  
 +
===Scheme===
 +
<pre class="scheme">
 +
(apply + list)
 +
</pre>
  
===Ruby===
+
===Tcl===
 +
<pre class="tcl">
 +
proc sum list {expr ([join $list +])}
 +
</pre>
 +
 
 +
===Zsh===
 
<pre>
 
<pre>
class Array
+
zsum() {
  def sum;    inject(0) { |s, v| s += v }; end
+
local -a array
end
+
array=(1 2 3 4 5)
 +
(( sum=${(j:+:)array} ))
 +
return sum
 +
}
 
</pre>
 
</pre>
  
Line 110: Line 190:
 
[[Category:Arrays]]
 
[[Category:Arrays]]
  
 +
[[Category:Algol 68]]
 +
[[Category:Assembly]]
 
[[Category:C]]
 
[[Category:C]]
 
[[Category:C++]]
 
[[Category:C++]]
[[Category:Assembly]]
+
[[Category:Common Lisp]]
 +
[[Category:Erlang]]
 +
[[Category:Excel]]
 +
[[Category:F sharp]]
 +
[[Category:Haskell]]
 
[[Category:Java]]
 
[[Category:Java]]
[[Category:Python]]
 
 
[[Category:Objective Caml]]
 
[[Category:Objective Caml]]
 +
[[Category:Perl]]
 +
[[Category:Python]]
 
[[Category:Ruby]]
 
[[Category:Ruby]]
 +
[[Category:Scheme]]
 +
[[Category:Tcl]]
 +
[[Category:Zsh]]

Latest revision as of 15:50, 10 August 2012

Related content:

This code demonstrates how to calculate the sum of a container (most often an array or similar structure).

See also[edit]

Implementations[edit]

Algol 68[edit]

The following function computes the sum of the elements of the array passed to it. The type of the array elements is called NUM, which can be defined as any suitable integer or real type.

MODE NUM = INT; # type of array element #

PROC sum = ([] NUM a) NUM :
    BEGIN
        NUM result := 0;
        FOR i FROM LWB a TO UPB a DO
            result +:= a[i]
        OD;
        result
    END

For instance, the call

sum((3, 4, 5, 6))

returns 18.

Assembly[edit]

INT_MAX = 2147483647.

sum proc
	mov ecx,DWORD PTR [esp]
	add esp,4
	xor eax,eax
	sum_loop1:
	add eax,DWORD PTR [esp]
	add esp,4
	cmp DWORD PTR [esp],2147483647
	jne sum_loop1
	mov DWORD PTR [esp],ecx
	ret
sum endp

C[edit]

int total( int numbers[], int size ) {
   int sum = 0, i;
   for ( i = 0 ; i < size ; i++ )
   {
      sum += numbers[i];
   }
   return sum;
}

C++[edit]

#include<numeric>

sum = std::accumulate(coll.begin(),coll.end(),0);

Common Lisp[edit]

(reduce #'+ list)
(reduce #'+ list :initial-value 0) ; improved version that also works with empty lists

Another way:

(apply #'+ list)

Erlang[edit]

lists:sum(List).

Excel[edit]

=SUM([cells])

F#[edit]

Seq.sum container

Haskell[edit]

sum container

For example:

Prelude> sum [1, 2, 3, 4]
10

Java[edit]

import java.util.*;

public class Total {

    public static int total(int... values) {
        int total = 0;
        for (int i : values) total += i;       
        return total;
    }

    public static void main(String[] args) {

        System.out.println("Total: %d: ", total(1,2,4,40));
        
    }
}

OCaml[edit]

Summing is a special case of folding the addition operator starting with zero:

# let sum = List.fold_left ( + ) 0;;
val sum : int list -> int = <fun>

For example:

# sum [1; 2; 4; 40];;
- : int = 47

Perl[edit]

use List::Util qw(sum);
sum @arr;
sum 0, @arr; # improved version that also works with empty arrays

Python[edit]

A function that sums the values in a sequence is built into python, its name is 'sum'.

assert sum([1,2,3]) == 6

Ruby[edit]

class Array
  def sum
    inject { |s, v| s += v }
  end
end

Or more concisely,

class Array
  def sum
    reduce(:+)
  end
end

Scheme[edit]

(apply + list)

Tcl[edit]

proc sum list {expr ([join $list +])}

Zsh[edit]

zsum() {
	local -a array
	array=(1 2 3 4 5)
	(( sum=${(j:+:)array} ))
	return sum
}