-
Notifications
You must be signed in to change notification settings - Fork 287
/
Copy pathrecpro.c
60 lines (49 loc) · 1.27 KB
/
recpro.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
#include<stdio.h>
//recursive function to find maximum element in an array
int Findmaxnumber(int array[], int index, int len)
{
int max;
if(index >= len-2)
{
if(array[index] > array[index + 1])
return array[index];
else
return array[index + 1];
}
max = Findmaxnumber(array, index + 1, len);
if(array[index] > max)
return array[index];
else
return max;
}
//Recursive function to find minimum element in the array
int Findminnumber(int array[], int index, int len)
{
int min;
if(index >= len-2)
{
if(array[index] < array[index + 1])
return array[index];
else
return array[index + 1];
}
min = Findminnumber(array, index + 1, len);
if(array[index] < min)
return array[index];
else
return min;
}
void main()
{
int a[100],n;
printf("enter the size of the array: ");
scanf("%d",&n);
for (int i = 0; i < n; i++)
{
printf("enter the element at %d: ",i);
scanf("%d",&a[i]);
}
int max=Findmaxnumber(a,0,n);
int min=Findminnumber(a,0,n);
printf("the max element is %d and the min element is %d ",max,min);
}