File: gauss.c

package info (click to toggle)
chromium 138.0.7204.157-1~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,080,872 kB
  • sloc: cpp: 34,936,850; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,954; asm: 946,768; xml: 739,967; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,811; php: 13,980; tcl: 13,166; yacc: 8,925; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (48 lines) | stat: -rw-r--r-- 1,285 bytes parent folder | download | duplicates (20)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/*
 *  methods/gauss.c
 *
 *  Calculate the sum of a given range of integer numbers.
 *
 *  Somewhat of a more subtle way of calculation - and it even has a story
 *  behind it:
 *
 *  Supposedly during math classes in elementary school, the teacher of
 *  young mathematician Gauss gave the class an assignment to calculate the
 *  sum of all natural numbers between 1 and 100, hoping that this task would
 *  keep the kids occupied for some time. The story goes that Gauss had the
 *  result ready after only a few minutes. What he had written on his black
 *  board was something like this:
 *
 *    1 + 100 = 101
 *    2 + 99  = 101
 *    3 + 98  = 101
 *    .
 *    .
 *    100 + 1 = 101
 *
 *    s = (1/2) * 100 * 101 = 5050
 *
 *  A more general form of this formula would be
 *  
 *    s = (1/2) * (max + min) * (max - min + 1)
 *
 *  which is used in the piece of code below to implement the requested
 *  function in constant time, i.e. without dependencies on the size of the
 *  input parameters.
 *
 */

#include "gauss.h"


int gauss_get_sum (int min, int max)
{
	/* This algorithm doesn't work well with invalid range specifications
	   so we're intercepting them here. */
	if (max < min)
	{
		return 0;
	}

	return (int) ((max + min) * (double) (max - min + 1) / 2);
}