-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprogram12_3.c
69 lines (46 loc) · 1.18 KB
/
program12_3.c
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
//Accept N number from user and return the
// Difference between largest number & Smallest number.
#include <stdio.h>
#include <stdlib.h>
int Difference(int Arr[],int iLength)
{
int iCnt = 0, iMax = Arr[0], iMin = Arr[0];
for(iCnt = 0 ; iCnt < iLength ; iCnt++)
{
if((iMax) < Arr[iCnt])
{
iMax = Arr[iCnt];
}
}
for(iCnt = 0 ; iCnt < iLength ; iCnt++)
{
if((iMin) > Arr[iCnt])
{
iMin = Arr[iCnt];
}
}
return iMax - iMin;
}
int main()
{
int iSize = 0, iRet = 0, iCnt = 0;
int *p = NULL;
printf("ENTER Number of Elements : ");
scanf("%d",&iSize);
p = (int *)malloc(iSize * sizeof(int));
if (p == NULL)
{
printf("Unable to allocate memory !!!");
return -1;
}
printf("ENTER The %d Elements \n",iSize);
for ( iCnt = 0; iCnt < iSize; iCnt++)
{
printf("Enter %d Elements : \n",iCnt + 1);
scanf("%d",&p[iCnt]);
}
iRet = Difference(p, iSize);
printf("Difference is %d",iRet);
free(p);
return 0;
}