int sumOfLargestAndSmallest(int arr[],int n){
int max=arr[0],min=arr[0];
for(int k=1;k<n;k++){
if(arr[k]>max)
max=arr[k];
if(arr[k]<min)
min=arr[k];
}
return max+min;
}
int sumOfLargestAndSmallest(int arr[],int n){
int max=arr[0],min=arr[0];
for(int k=1;k<n;k++){
if(arr[k]>max)
max=arr[k];
if(arr[k]<min)
min=arr[k];
}
return max+min;
}
Hi friends....
In this blog I'm going to give answer for daily test skillrack program, daily challenges and kick start programs and give some coding techniques.
It'll be helpful for u sure and make it usefull
Learn More →
0 Comments