c_codes/array.c at main · b0sc/c_codes · GitHub

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
/*
#include<stdio.h>
void search (int[],int);
void main()
{
	int n,i;
	printf("no.of element in array :");
	scanf("%d",&n);
	int arr[n];
	for (i=0;i<n;i++)
	{
		printf("ENTER THE ELEMENT arr[%d]\n: ",i+1);

	}
	search(arr,n);
}
void search(int brr[],int size)
{
	int search,i;
	printf("element to be searched : ");
	scanf("%d",&search);
 for (i=0;i<size;i++)
	{
		if(search==brr[i])
		{
			printf("%d is  found",search);
			break;
		}
	}
	if (i==size)
	printf("%d is not  found",search);
}
*/

#include<stdio.h>
void small_large(int[],int);
void main()
{
	int n,i;
	printf("no.of element in array :");
	scanf("%d",&n);
	int arr[n];
	for (i=0;i<n;i++)
	{
		printf("ENTER THE ELEMENT arr[%d]\n: ",i+1);
		scanf("d",&arr[i]);

	}
	small_large(arr,n);
}
void small_large(int brr[],int size)
{
	int small,large,i;
	small= brr[0];
	large=brr[0];

	for (i=0;i<size;i++)
	{

		if(small>brr[i])
		small=brr[i];
		if(large<brr[i])
		large=brr[i];
}
	printf("\n Smallest element =%d and largest element is =%d",small,large);
}