/ * The fastest time, complexity minimum space (own sense of ha ha ha) to calculate the sum of all the elements of an array (merge ideas) * /
int getsum(int arr[], int length)
{
int interval = 1;
int i;
while( interval<length )
{
for( i=0; i+interval<length; i+=2*interval )
{
arr[i] = arr[i] + arr[i+interval];
}
interval *= 2;
}
return arr[0];
}