#include<stdio.h>
int main()
{
int arr[]={3,5,89,900,76,54,999,1299,1423,785};
int max = 0;
int sz = sizeof(arr)/sizeof(arr[0]);
int i = 0;
for(i = 0;i < sz; i++){
if(max < arr[i])
max = arr[i];
}
printf("max = %d\n",max);
return 0;
}
#include<stdio.h>
int Max(int arr[],int n)
{
int i = 0;
int max = 0;
for(i = 0;i < n;i++)
{
if(max < arr[i])
max = arr[i];
}
return max;
}
int main()
{
int arr[]={3,5,89,900,76,54,999,1299,1423,785};
int max = 0;
int sz = sizeof(arr)/sizeof(arr[0]);
max = Max(arr,sz);
printf("max = %d\n",max);
return 0;
}
#include<stdio.h>
void sort_descending(int arr[],int n)
{
int i = 0;
int temp = 0;
int j = 0;
for(i = 0;i < n - 1;i++)
{
for(j = n - 1;j > i;j--)
{
if(arr[j] > arr[j-1])
{
temp = arr[j-1];
arr[j-1] = arr[j];
arr[j] = temp;
}
}
}
}
int main()
{
int arr[]={11,2,711,45,64,3342,66,2232,
30000,23,12,290};
int sz = sizeof(arr)/sizeof(arr[0]);
int j = 0;
sort_descending(arr,sz);
for(j = 0;j < sz;j++)
printf("%d ",arr[j]);
printf("\n");
printf("max = %d\n",arr[0]);
return 0;
}