Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find the sum of the first half and second half elements of an array

  • Difficulty Level : Basic
  • Last Updated : 11 Jun, 2021

Given an array arr of size N. The task is to find the sum of the first half (N/2) elements and second half elements (N – N/2) of an array.
Examples: 

Input : arr[] = {20, 30, 60, 10, 25, 15, 40} 
Output : 110, 90 
Sum of first N/2 elements 20 + 30 + 60 is 110
Input : arr[] = {50, 35, 20, 15} 
Output : 85, 35

Approach: 
Initialize SumFirst and SumSecond as 0. Traverse the given array and add elements in SumFirst if the current index is less than N/2 otherwise add in SumSecond.
Below is the implementation of the above approach: 

C++




// 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



// 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



# 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#



// 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
Javascript



<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>
Output: 
Sum of first half elements is 110
Sum of second half elements is 90
 
Time complexity: O(N)
Auxiliary Space: O(1)

My Personal Notes
arrow_drop_up
Next

Sum of elements in range L-R where first half and second half is filled with odd and even numbers
Recommended Articles
Page :
Find the XOR of first half and second half elements of an array
27, Apr 20
Sum of elements in range L-R where first half and second half is filled with odd and even numbers
08, Aug 18
Find prime numbers in the first half and second half of an array
22, Jul 19
Sort first half in ascending and second half in descending order | Set 2
16, Aug 18
Sort first half in ascending and second half in descending order | 1
29, Aug 17
Count number of rotated strings which have more number of vowels in the first half than second half
23, Oct 19
Check if array sum of first half is divisible by sum of other half or vice versa
10, Nov 21
Find all even length binary sequences with same sum of first and second half bits | Iterative
26, Sep 19
Reorder an array such that sum of left half is not equal to sum of right half
16, Jun 20
Check if sum of digits in the left half is divisible by sum of digits in the right half in the largest permutation of N
15, Jun 21
Find a permutation of 1 to N, such that A is minimum in left half and B is maximum in right half
21, Dec 21
Minimize swaps between two arrays such that sum of the first array exceeds sum of the second array
18, Jan 21
Find elements which are present in first array and not in second
29, Jan 17
Find the first, second and third minimum elements in an array
22, Oct 17
Find the maximum elements in the first and the second halves of the Array
30, Jul 19
Find numbers which are multiples of first array and factors of second array
30, Sep 19
Count of elements in first Array greater than second Array with each element considered only once
07, May 20
Count distinct elements after adding each element of First Array with Second Array
31, Jul 20
Count elements in first Array with absolute difference greater than K with an element in second Array
05, May 20
Check if mapping is possible to make sum of first array larger than second array
17, Jun 21
Number of indices pair such that element pair sum from first Array is greater than second Array
25, Mar 20
Find just strictly greater element from first array for each element in second array
05, May 20
First subarray having sum at least half the maximum sum of any subarray of size K
09, Sep 20
Count elements present in first array but not in second
06, Oct 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
apurva_sharma244
@apurva_sharma244
Vote for difficulty
Current difficulty :
Basic





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!