File: gauss.c

package info (click to toggle)
chromium 120.0.6099.224-1~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 6,112,112 kB
  • sloc: cpp: 32,907,025; ansic: 8,148,123; javascript: 3,679,536; python: 2,031,248; asm: 959,718; java: 804,675; xml: 617,256; sh: 111,417; objc: 100,835; perl: 88,443; cs: 53,032; makefile: 29,579; fortran: 24,137; php: 21,162; tcl: 21,147; sql: 20,809; ruby: 17,735; pascal: 12,864; yacc: 8,045; lisp: 3,388; lex: 1,323; ada: 727; awk: 329; jsp: 267; csh: 117; exp: 43; sed: 37
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);
}