Encuentre la suma de los elementos de la primera mitad y la segunda mitad de una array

Dada una array arr de tamaño N . La tarea es encontrar la suma de los elementos de la primera mitad ( N/2 ) y los elementos de la segunda mitad ( N – N/2 ) de una array.
Ejemplos: 

Entrada: arr[] = {20, 30, 60, 10, 25, 15, 40} 
Salida: 110, 90  La
suma de los primeros N/2 elementos 20 + 30 + 60 es 110
Entrada: arr[] = {50, 35 , 20, 15} 
Salida : 85, 35

Enfoque: 
Inicialice SumFirst y SumSecond como 0. Recorra la array dada y agregue elementos en SumFirst si el índice actual es menor que N/2; de lo contrario, agregue SumSecond.
A continuación se muestra la implementación del enfoque anterior: 

// C++ program to find the sum of the first half
// elements and second half elements of an array
#include <bits/stdc++.h>
using namespace std;
 
// Function to find the sum of the first half
// elements and second half elements of an array
void sum_of_elements(int arr[], int n)
{
    int sumfirst = 0, sumsecond = 0;
 
    for (int i = 0; i < n; i++) {
        // Add elements in first half sum
        if (i < n / 2)
            sumfirst += arr[i];
 
        // Add elements in the second half sum
        else
            sumsecond += arr[i];
    }
 
    cout << "Sum of first half elements is " <<
                                   sumfirst << endl;
 
    cout << "Sum of second half elements is " <<
                                   sumsecond << endl;
}
 
// Driver Code
int main()
{
    int arr[] = { 20, 30, 60, 10, 25, 15, 40 };
 
    int n = sizeof(arr) / sizeof(arr[0]);
 
    // Function call
    sum_of_elements(arr, n);
 
    return 0;
}

// Java program to count pairs
// whose sum divisible by 'K'
import java.util.*;
 
class GFG
{
 
public static void sum_of_elements(int []arr,
                                   int n)
{
    int sumfirst = 0, sumsecond = 0;
     
    for (int i = 0; i < n; i++)
    {
         
        // Add elements in first half sum
        if (i < n / 2)
        {
            sumfirst += arr[i];
        }
         
        // Add elements in the second half sum
        else
        {
            sumsecond += arr[i];
        }
    }
     
    System.out.println("Sum of first half elements is " +
                                             sumfirst);
     
    System.out.println("Sum of second half elements is " +
                                            sumsecond);
}
 
// Driver code
public static void main(String[] args)
{
    int []arr = { 20, 30, 60, 10, 25, 15, 40 };
    int n = arr.length;
     
    // Function call
    sum_of_elements(arr, n);
}
}
 
// This code is contributed by Princi Singh

# Python3 program to find the sum of
# the first half elements and
# second half elements of an array
 
# Function to find the sum of 
# the first half elements and
# second half elements of an array
def sum_of_elements(arr, n):
 
    sumfirst = 0;
    sumsecond = 0;
 
    for i in range(n):
         
        # Add elements in first half sum
        if (i < n // 2):
            sumfirst += arr[i];
 
        # Add elements in the second half sum
        else:
            sumsecond += arr[i];
             
    print("Sum of first half elements is",
                    sumfirst, end = "\n");
    print("Sum of second half elements is",
                    sumsecond, end = "\n");
 
# Driver Code
arr = [20, 30, 60, 10, 25, 15, 40];
 
n = len(arr);
 
# Function call
sum_of_elements(arr, n);
 
# This code is contributed
# by Akanksha Rai

// C# program to count pairs
// whose sum divisible by 'K'
using System;
 
class GFG
{
    public static void sum_of_elements(int []arr,
                                       int n)
    {
         
    int sumfirst = 0, sumsecond = 0;
 
    for (int i = 0; i < n; i++)
    {
         
        // Add elements in first half sum
        if (i < n / 2)
        {
            sumfirst += arr[i];
        }
         
        // Add elements in the second half sum
        else
        {
            sumsecond += arr[i];
        }
    }
 
    Console.WriteLine("Sum of first half elements is " +
                                              sumfirst);
     
    Console.WriteLine("Sum of second half elements is " +
                                              sumsecond);
}
 
// Driver code
static public void Main ()
{
    int []arr = { 20, 30, 60, 10, 25, 15, 40 };
    int n = arr.Length;
     
    // Function call
    sum_of_elements(arr, n);
}
}
 
// This code is contributed by nidhiva

<script>
 
// Javascript program to count pairs
// whose sum divisible by 'K'
 
    function sum_of_elements(arr , n)
    {
        var sumfirst = 0, sumsecond = 0;
 
        for (i = 0; i < n; i++) {
 
            // Add elements in first half sum
            if (i < parseInt(n / 2))
            {
                sumfirst += arr[i];
            }
 
            // Add elements in the second half sum
            else {
                sumsecond += arr[i];
            }
        }
 
        document.write(
     "Sum of first half elements is " + sumfirst+"<br/>"
        );
 
        document.write(
    "Sum of second half elements is " + sumsecond+"<br/>"
        );
    }
 
    // Driver code
     
        var arr = [ 20, 30, 60, 10, 25, 15, 40 ];
        var n = arr.length;
 
        // Function call
        sum_of_elements(arr, n);
 
// This code contributed by umadevi9616
 
</script>

Sum of first half elements is 110
Sum of second half elements is 90

Complejidad de tiempo: O (N), ya que estamos usando un ciclo para atravesar la array.
Espacio auxiliar: O(1), ya que no estamos utilizando ningún espacio adicional.