Efficient C ++ method to find sum of the elements of array that is halfway increasing and then halfway decreassing
#include <iostream> NEW_LINE using namespace std ; int arraySum ( int arr [ ] , int n ) { int x = ( n + 1 ) / 2 ; return ( arr [ 0 ] - 1 ) * n + x * x ; }