blob: d51813432d7b368081761a3cdfa47e9c24b89d5a (
plain) (
blame)
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
49
50
51
52
53
54
55
56
57
|
#include "arrmath.h"
int sum(const int* elements, unsigned length) {
if (elements == nullptr || length == 0)
return 0;
int sum = 0;
for (unsigned i = 0; i < length; ++i)
sum += elements[i];
return sum;
}
double average(const int* elements, unsigned length) {
if (elements == nullptr || length == 0)
return 0.0;
return (double)sum(elements, length) / length;
}
int largest(const int* elements, unsigned length) {
if (elements == nullptr || length == 0)
return 0;
int largest = elements[0];
for (unsigned i = 1; i < length; ++i)
if (elements[i] > largest)
largest = elements[i];
return largest;
}
int smallest(const int* elements, unsigned length) {
if (elements == nullptr || length == 0)
return 0;
int smallest = elements[0];
for (unsigned i = 1; i < length; ++i)
if (elements[i] < smallest)
smallest = elements[i];
return smallest;
}
unsigned findIndex(const int* elements, unsigned length, int elementToSearch) {
if (elements == nullptr || length == 0)
return length;
for (unsigned i = 0; i < length; ++i)
if (elements[i] == elementToSearch)
return i;
// Коректно е да връщаме length вместо 0, защото
// 0 може да е валиден индекс в масива с елементи
return length;
}
|
