HackerRank C++ Algorithms: Mini-Max Sum (warmup solution)

HackerRank C++ solution for the warmup algorithm coding challenge called Mini-Max Sum, which requires us to calculate both the minimum sum and maximum sum of numbers in an array. Here, we use a vector of integers as our array, and process the vector's elements in linear fashion in a single loop, to return both the minimum sum and the maximum sum. This C++ algorithm runs in constant time, O(1), because we are only summing up the first 4 numbers and the last 4 numbers after sorting our vector using the sort function. The loop therefore does not depend on the size of our input (i.e. vector size); that's why this algorithm's time complexity is constant. Auxiliary space is also constant, as we are not growing the memory space that our algorithm requires based on the input size.

[nextrie]

Which algorithm did you find the hardest to code so far on HackerRank?

[bhanuprakash]

#include<bits/stdc++.h>
using namespace std;
int main()
{
int a;
int n=5;
vector<long> v;
for(long i=0;i<n;i++)
{
cin>>a;
v.push_back(a);
}
int s=v.size();
sort(v.begin(), v.end());
long max=0;
long min=0;
for(long i=0;i<v.size()-1;i++)
{
max=max+v[i];
}
for(long i=1;i<v.size();i++)
{
min=min+v[i];
}
cout<<max<<" "<<min;
return 0;
}
easy code
for beginners

[MakineMakine]

Could you explain why we typed -i on [size-1-i] ?

[Timekepper]

1:37 why did you use argument by reference ??

[namithapradeep]

Hello..Why we use sort() function in this program?

[anuj_abh]

can you please explain why you wrote, i < 4, for range.

[neons]

Is w3school a good website to learn c++?

[toilacube]

if you submit the code, it's actually not correct in some cases because their input is out of integer size