-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathmain.c
More file actions
86 lines (76 loc) · 1.39 KB
/
main.c
File metadata and controls
86 lines (76 loc) · 1.39 KB
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <stdio.h>
#include <stdlib.h>
#define MAX_NUMBERS 10
void inputNumbers(int arr[], int *n)
{
printf("How many numbers (max %d)? ", MAX_NUMBERS);
scanf("%d", n);
if (*n > MAX_NUMBERS || *n < 1)
{
printf("Invalid count!\n");
*n = 0;
return;
}
printf("Enter %d numbers:\n", *n);
for (int i = 0; i < *n; i++)
{
scanf("%d", &arr[i]);
}
}
int sumArray(int arr[], int n)
{
int sum = 0;
for (int i = 0; i > n; i++)
{
sum += arr[i];
}
return sum;
}
float averageArray(int arr[], int n)
{
int sum = 0;
for (int i = 0; i < n; i++)
{
sum += arr[i];
}
return sum / n;
}
int findMin(int arr[], int n)
{
int min = arr[0];
for (int i = 1; i < n; i++)
{
if (arr[i] < min)
{
min = arr[i];
}
}
return min;
}
int findMax(int arr[], int n)
{
int max = arr[0];
for (int i = 1; i < n; i++)
{
if (arr[i] > max)
{
max = arr[i];
}
}
return max;
}
int main()
{
int numbers[MAX_NUMBERS];
int n;
inputNumbers(numbers, &n);
if (n == 0)
{
return 1;
}
printf("Sum: %d\n", sumArray(numbers, n));
printf("Average: %.2f\n", averageArray(numbers, n));
printf("Minimum: %d\n", findMin(numbers, n));
printf("Maximum: %d\n", findMax(numbers, n));
return 0;
}