Can you do the above task in a minimum number of comparisons?
The first line of input contains a single integer T, representing the number of test cases. Then the T test cases follow. The first line of each test case contains a single integer N representing the size of the array 'ARR'. The second line of each test case contains N space separated integers representing the elements of the array “arr”.
For each test case, print the sum of the maximum and minimum element of the array 'ARR'.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10 1 <= N <= 10^5 -10^9 <= ARR[i] <= 10^9 Time limit: 1 second
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End