Program to print Sum of even and odd elements in an array
Last Updated :
31 Mar, 2023
Prerequisite - Array Basics
Given an array, write a program to find the sum of values of even and odd index positions separately.
Examples:
Input : arr[] = {1, 2, 3, 4, 5, 6}
Output :Even index positions sum 9
Odd index positions sum 12
Explanation: Here, n = 6 so there will be 3 even
index positions and 3 odd index positions in an array
Even = 1 + 3 + 5 = 9
Odd = 2 + 4 + 6 = 12
Input : arr[] = {10, 20, 30, 40, 50, 60, 70}
Output : Even index positions sum 160
Odd index positions sum 120
Explanation: Here, n = 7 so there will be 3 odd
index positions and 4 even index positions in an array
Even = 10 + 30 + 50 + 70 = 160
Odd = 20 + 40 + 60 = 120
Implementation:
C++
// CPP program to find out
// Sum of elements at even and
// odd index positions separately
#include <iostream>
using namespace std;
// Function to calculate sum
void EvenOddSum(int arr[], int n)
{
int even = 0;
int odd = 0;
for (int i = 0; i < n; i++) {
// Loop to find even, odd sum
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
cout << "Even index positions sum " << even;
cout << "\nOdd index positions sum " << odd;
}
// Driver function
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6 };
int n = sizeof(arr) / sizeof(arr[0]);
EvenOddSum(arr, n);
return 0;
}
// Java program to find out
// Sum of elements at even and
// odd index positions separately
import java.io.*;
class EvenOddSum {
public static void main(String args[])
{
int arr[] = { 1, 2, 3, 4, 5, 6 };
int even = 0, odd = 0;
// Loop to find even, odd sum
for (int i = 0; i < arr.length; i++) {
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
System.out.println("Even index positions sum: " + even);
System.out.println("Odd index positions sum: " + odd);
}
}
# Python program to find out
# Sum of elements at even and
# odd index positions separately
# Function to calculate Sum
def EvenOddSum(a, n):
even = 0
odd = 0
for i in range(n):
# Loop to find even, odd Sum
if i % 2 == 0:
even += a[i]
else:
odd += a[i]
print ("Even index positions sum ", even)
print ("nOdd index positions sum ", odd)
# Driver Function
arr = [1, 2, 3, 4, 5, 6]
n = len(arr)
EvenOddSum(arr, n)
# This code is contributed by Sachin Bisht
// C# program to find out
// Sum of elements at even and
// odd index positions separately
using System;
public class GFG {
public static void Main()
{
int[] arr = { 1, 2, 3, 4, 5, 6 };
int even = 0, odd = 0;
// Loop to find even, odd sum
for (int i = 0; i < arr.Length; i++)
{
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
Console.WriteLine("Even index positions"
+ " sum: " + even);
Console.WriteLine("Odd index positions "
+ "sum: " + odd);
}
}
// This code is contributed by Sam007.
<?php
// PHP program to find out
// Sum of elements at even and
// odd index positions separately
// Function to calculate sum
function EvenOddSum($arr, $n)
{
$even = 0;
$odd = 0;
for ($i = 0; $i < $n; $i++)
{
// Loop to find even, odd sum
if ($i % 2 == 0)
$even += $arr[$i];
else
$odd += $arr[$i];
}
echo("Even index positions sum " . $even);
echo("\nOdd index positions sum " . $odd);
}
// Driver Code
$arr = array( 1, 2, 3, 4, 5, 6 );
$n = sizeof($arr);
EvenOddSum($arr, $n);
// This code is contributed by Ajit.
?>
<script>
// Javascript program to find out
// Sum of elements at even and
// odd index positions separately
// Function to calculate sum
function EvenOddSum(arr, n)
{
let even = 0;
let odd = 0;
for (let i = 0; i < n; i++)
{
// Loop to find even, odd sum
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
document.write("Even index positions sum " + even);
document.write("<br>" + "Odd index positions sum " + odd);
}
// Driver function
let arr = [ 1, 2, 3, 4, 5, 6 ];
let n = arr.length;
EvenOddSum(arr, n);
// This code is contributed by Mayank Tyagi
</script>
OutputEven index positions sum 9
Odd index positions sum 12
Time Complexity: O(length(arr))
Auxiliary Space: 0(1)
Method 2: Using bitwise & operator
C++
// CPP program to find out
// Sum of elements at even and
// odd index positions separately using bitwise & operator
#include <iostream>
using namespace std;
// Function to calculate sum
void EvenOddSum(int arr[], int n)
{
int even = 0;
int odd = 0;
for (int i = 0; i < n; i++) {
// Loop to find even, odd sum
if (i & 1 != 0)
odd += arr[i];
else
even += arr[i];
}
cout << "Even index positions sum " << even;
cout << "\nOdd index positions sum " << odd;
}
// Driver function
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6 };
int n = sizeof(arr) / sizeof(arr[0]);
EvenOddSum(arr, n);
return 0;
}
//This code is contributed by Vinay Pinjala.
// Java program to find out
// Sum of elements at even and
// odd index positions separately using bitwise & operator
public class Main {
public static void main(String[] args)
{
int[] arr = { 1, 2, 3, 4, 5, 6 };
int n = arr.length;
int even = 0;
int odd = 0;
for (int i = 0; i < n; i++)
{
// Loop to find even, odd sum
if ((i & 1) != 0) {
odd += arr[i];
}
else {
even += arr[i];
}
}
System.out.println("Even index positions sum: "
+ even);
System.out.println("Odd index positions sum: "
+ odd);
}
}
// This code is contributed by divyansh2212
# Python program to find out
# Sum of elements at even and
# odd index positions separately using bitwise & operator
# Function to calculate Sum
def EvenOddSum(a, n):
even = 0
odd = 0
for i in range(n):
# Loop to find even, odd Sum
if i &1:
odd += a[i]
else:
even += a[i]
print ("Even index positions sum ", even)
print ("Odd index positions sum ", odd)
# Driver Function
arr = [1, 2, 3, 4, 5, 6]
n = len(arr)
EvenOddSum(arr, n)
# This code is contributed by tvsk
using System;
namespace TestApplication
{
class Program
{
static void Main(string[] args)
{
int[] arr = { 1, 2, 3, 4, 5, 6 };
int n = arr.Length;
int even = 0;
int odd = 0;
for (int i = 0; i < n; i++)
{
// Loop to find even, odd sum
if ((i & 1) != 0)
{
odd += arr[i];
}
else
{
even += arr[i];
}
}
Console.WriteLine("Even index positions sum: " + even);
Console.WriteLine("Odd index positions sum: " + odd);
}
}
}
// JS program to find out
// Sum of elements at even and
// odd index positions separately using bitwise & operator
// Function to calculate sum
function EvenOddSum(arr, n)
{
let even = 0;
let odd = 0;
for (let i = 0; i < n; i++)
{
// Loop to find even, odd sum
if (i & 1 != 0)
odd += arr[i];
else
even += arr[i];
}
console.log("Even index positions sum " + even);
console.log("\nOdd index positions sum " + odd);
}
// Driver function
let arr = [ 1, 2, 3, 4, 5, 6 ];
let n = arr.length;
EvenOddSum(arr, n);
OutputEven index positions sum 9
Odd index positions sum 12
Time Complexity: O(length(arr))
Auxiliary Space: 0(1)
Calculate sum of all even indices using slicing and repeat the same with odd indices and print sum.
Below is the implementation:
C++
#include <iostream>
using namespace std;
// Function to calculate sum
int EvenOddSum(int arr[] , int n)
{
int even = 0;
int odd = 0;
// Loop to find even, odd sum
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
cout<<"Even index positions sum "<<even<<"\n" ;
cout<<"Odd index positions sum " <<odd;
}
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6 };
int n =sizeof(arr)/sizeof(arr[0]);
EvenOddSum(arr, n);
}
// This code is contributed by ksrikanth0498.
// Java program to find out sum of elements at even
// and odd index positions separately
import java.io.*;
class GFG {
// Function to calculate sum
static void EvenOddSum(int[] arr, int n)
{
int even = 0;
int odd = 0;
// Loop to find even, odd sum
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
System.out.println("Even index positions sum "
+ even);
System.out.print("Odd index positions sum " + odd);
}
public static void main(String[] args)
{
int[] arr = { 1, 2, 3, 4, 5, 6 };
int n = arr.length;
EvenOddSum(arr, n);
}
}
// This code is contributed by lokeshmvs21.
# Python program to find out
# Sum of elements at even and
# odd index positions separately
# Function to calculate Sum
def EvenOddSum(a, n):
even_sum = sum(a[::2])
odd_sum = sum(a[1::2])
print("Even index positions sum", even_sum)
print("Odd index positions sum", odd_sum)
# Driver Function
arr = [1, 2, 3, 4, 5, 6]
n = len(arr)
EvenOddSum(arr, n)
# This code is contributed by vikkycirus
// C# program to find out sum of elements at even
// and odd index positions separately
using System;
public class GFG {
// Function to calculate sum
static void EvenOddSum(int[] arr, int n)
{
int even = 0;
int odd = 0;
// Loop to find even, odd sum
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
Console.WriteLine("Even index positions sum "
+ even);
Console.WriteLine("Odd index positions sum " + odd);
}
static public void Main()
{
// Code
int[] arr = { 1, 2, 3, 4, 5, 6 };
int n = arr.Length;
EvenOddSum(arr, n);
}
}
// This code is contributed by lokeshmvs21.
<script>
// Javascript program to find out
// Sum of elements at even and
// odd index positions separately
// Function to calculate sum
function EvenOddSum(arr, n)
{
let even = 0;
let odd = 0;
for (let i = 0; i < n; i++)
{
// Loop to find even, odd sum
if (i % 2 == 0)
even += arr[i];
else
odd += arr[i];
}
document.write("Even index positions sum " + even);
document.write("<br>" + "Odd index positions sum " + odd);
}
// Driver function
let arr = [ 1, 2, 3, 4, 5, 6 ];
let n = arr.length;
EvenOddSum(arr, n);
// This code is contributed by avijitmondal1998.
</script>
OutputEven index positions sum 9
Odd index positions sum 12
Time Complexity: O(n) where n is no of elements in given array
Auxiliary Space: 0(1)
Method 2: Using bitwise | operator
C++14
// C++ program to find out
// Sum of elements at even and
// odd index positions separately using bitwise | operator
#include<bits/stdc++.h>
using namespace std;
// Function to calculate Sum
void EvenOddSum(vector<int>a, int n)
{
int even = 0;
int odd = 0;
for(int i=0; i<n; i++)
{
// Loop to find even, odd Sum
if ((i|1)==i)
odd+=a[i];
else
even+=a[i];
}
cout<< "Even index positions sum "<< even<<endl;
cout<< "Odd index positions sum "<< odd<<endl;
}
// Driver Function
int main()
{
vector<int>arr = {1, 2, 3, 4, 5, 6};
int n = arr.size();
EvenOddSum(arr, n);
}
# Python program to find out
# Sum of elements at even and
# odd index positions separately using bitwise | operator
# Function to calculate Sum
def EvenOddSum(a, n):
even = 0
odd = 0
for i in range(n):
# Loop to find even, odd Sum
if i|1==i:
odd+=a[i]
else:
even+=a[i]
print ("Even index positions sum ", even)
print ("Odd index positions sum ", odd)
# Driver Function
arr = [1, 2, 3, 4, 5, 6]
n = len(arr)
EvenOddSum(arr, n)
// JavaScript program to find out
// Sum of elements at even and
// odd index positions separately using bitwise | operator
// Function to calculate Sum
function EvenOddSum(a, n) {
let even = 0;
let odd = 0;
for(let i = 0; i < n; i++) {
// Loop to find even, odd Sum
if ((i|1) === i)
odd += a[i];
else
even += a[i];
}
console.log("Even index positions sum ", even);
console.log("Odd index positions sum ", odd);
}
// Driver Function
const arr = [1, 2, 3, 4, 5, 6];
const n = arr.length;
EvenOddSum(arr, n);
import java.util.*;
class Main {
// Function to calculate Sum of elements at even and odd
// index positions separately
static void EvenOddSum(List<Integer> a, int n)
{
int even = 0;
int odd = 0;
for (int i = 0; i < n; i++) {
// Loop to find even, odd Sum
if ((i | 1) == i) {
odd += a.get(i);
}
else {
even += a.get(i);
}
}
// Print the sum of elements at even and odd index
// positions
System.out.println("Even index positions sum "
+ even);
System.out.println("Odd index positions sum "
+ odd);
}
// Driver Function
public static void main(String[] args)
{
// Create a list of integers
List<Integer> arr = new ArrayList<>(
Arrays.asList(1, 2, 3, 4, 5, 6));
// Get the size of the list
int n = arr.size();
// Call the EvenOddSum function
EvenOddSum(arr, n);
}
}
// C# program to find out
// Sum of elements at even and
// odd index positions separately using bitwise | operator
using System;
using System.Collections.Generic;
class MainClass {
// Function to calculate Sum
static void EvenOddSum(List<int> a, int n)
{
int even = 0;
int odd = 0;
for (int i = 0; i < n; i++) {
// Loop to find even, odd Sum
if ((i | 1) == i)
odd += a[i];
else
even += a[i];
}
Console.WriteLine("Even index positions sum "
+ even);
Console.WriteLine("Odd index positions sum " + odd);
}
// Driver Function
public static void Main(string[] args)
{
List<int> arr = new List<int>{ 1, 2, 3, 4, 5, 6 };
int n = arr.Count;
EvenOddSum(arr, n);
}
}
OutputEven index positions sum 9
Odd index positions sum 12
Time Complexity: O(length(arr))
Auxiliary Space: 0(1)
Similar Reads
Program to print product of even and odd indexed elements in an Array
Given an array of integers. The task is to write a program to find the product of elements at even and odd index positions separately. Note: 0-based indexing is considered for the array. That is the index of the first element in the array is zero. Examples: Input : arr = {1, 2, 3, 4, 5, 6} Output :
9 min read
Count of odd and even sum pairs in an array
Given an array arr[] of N positive integers, the task is to find the number of pairs with odd sum and the number of pairs with even sum.Examples: Input: arr[] = {1, 2, 3, 4, 5} Output: Odd pairs = 6 Even pairs = 4Input: arr[] = {7, 4, 3, 2} Output: Odd pairs = 4 Even pairs = 2 Naive Approach: The na
8 min read
Sum of all even occurring element in an array
Given an array of integers containing duplicate elements. The task is to find the sum of all even occurring elements in the given array. That is the sum of all such elements whose frequency is even in the array. Examples: Input : arr[] = {1, 1, 2, 2, 3, 3, 3}Output : 6The even occurring element are
12 min read
Sum of all odd frequency elements in an array
Given an array of integers containing duplicate elements. The task is to find the sum of all odd occurring elements in the given array. That is the sum of all such elements whose frequency is odd in the array. Examples: Input : arr[] = {1, 1, 2, 2, 3, 3, 3} Output : 9 The odd occurring element is 3,
8 min read
Count of even and odd power pairs in an Array
Given an array arr[] of length N, the task is to count the number of pairs (X, Y) such that XY is even and count the number of pairs such that XY is odd.Examples: Input: arr[] = {2, 3, 4, 5} Output: 6 6 Explanation: (2, 3), (2, 4), (2, 5), (4, 2), (4, 3) and (4, 5) are the pairs with even values and
5 min read
Sum of elements from an array having even parity
Given an array arr[], the task is to calculate the sum of the elements from the given array which has even parity i.e. the number of set bits is even using bitwise operator. Examples: Input: arr[] = {2, 4, 3, 5, 9} Output: 17 Only 3(0011), 5(0101) and 9(1001) have even parity So 3 + 5 + 9 = 17 Input
6 min read
Modify given array to make sum of odd and even indexed elements same
Given a binary array arr[] of size N, remove at most N/2 elements from the array such that the sum of elements at odd and even indices becomes equal. The task is to print the modified array.Note: N is always even. There can be more than one possible result, print any of them. Examples: Input: arr[]
10 min read
Sum of even elements of an Array using Recursion
Given an array arr[] of integers, the task is to find the sum of even elements from the array. Examples: Input: arr[] = {1, 2, 3, 4, 5, 6, 7, 8} Output: 20 2 + 4 + 6 + 8 = 20Input: arr[] = {4, 1, 3, 6} Output: 10 4 + 6 = 10 Approach: Write a recursive function that takes the array as an argument wit
5 min read
Ways to make sum of odd and even indexed elements equal by removing an array element
Given an array, arr[] of size n, the task is to find the count of array indices such that removing an element from these indices makes the sum of even-indexed and odd-indexed array elements equal.Examples:Input: arr[] = [ 2, 1, 6, 4 ] Output: 1 Explanation: Removing arr[1] from the array modifies ar
10 min read
Two odd occurring elements in an array where all other occur even times
Given an array where all elements appear even number of times except two, print the two odd occurring elements. It may be assumed that the size of array is at-least two. Examples: Input : arr[] = {2, 3, 8, 4, 4, 3, 7, 8} Output : 2 7 Input : arr[] = {15, 10, 10, 50 7, 5, 5, 50, 50, 50, 50, 50} Outpu
15+ min read