-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathMinElementInArray.c
54 lines (43 loc) · 1007 Bytes
/
MinElementInArray.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
#include<stdio.h>
int getMinVal(int[], int);
int getMinValUsingTailRecursion(int[], int, int);
int main(){
int num;
printf("Enter the number of elements you want to enter\n");
scanf("%d", &num);
int arr[num];
int i;
for(i = 0; i < num; ++i) {
scanf("%d", &arr[i]);
}
printf("Minimum element in the array is %d\n", getMinVal(arr, num - 1));
printf("Minimum element in the array using Tail Recursion is %d\n", getMinValUsingTailRecursion(arr, num, arr[0]));
return 0;
}
/*
Time: O(n)
Space: O(n)
*/
int getMinVal(int arr[], int size) {
if(size == 0) {
return arr[0];
}
int min = getMinVal(arr, size - 1);
if(arr[size] < min) {
return arr[size];
}
return min;
}
/*
Time: O(n)
Space: O(1)
*/
int getMinValUsingTailRecursion(int arr[], int size, int min) {
if(size == 1) {
return min;
}
if(arr[size - 1] < min) {
return getMinValUsingTailRecursion(arr, size - 1, arr[size - 1]);
}
return getMinValUsingTailRecursion(arr, size - 1, min);
}