-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFindMinElement.c
53 lines (50 loc) · 995 Bytes
/
FindMinElement.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
#include<stdio.h>
int * sortArray(int *arr, int length)
{
int x=0,y=0,n=length;
for(x=0;x<n;x++)
{
int index_of_min = x;
for(y=x;y<n;y++)
{
if(arr[index_of_min]>arr[y])
{
index_of_min=y;
}
}
int temp=arr[x];
arr[x]=arr[index_of_min];
arr[index_of_min]=temp;
}
return arr;
}
void minElement(int arr1[],int arr2[],int size)
{
int index;
sortArray(arr1, size);
sortArray(arr2, size);
int min=0;
if(arr1[0]>arr2[0]){
min=arr2[0];
}
else{
min=arr1[0];
}
printf("%d",min);
}
int main()
{
int size;
scanf("%d",&size);
int arr1[size],arr2[size];
for(int i=0;i<size;i++)
{
scanf("%d",&arr1[i]);
}
for(int i=0;i<size;i++)
{
scanf("%d",&arr2[i]);
}
minElement(arr1,arr2,size);
return 0;
}