Find XOR of all elements in an Array

Given an array arr[] containing integers of size N, the task is to find the XOR of this array.

Examples:

Input: arr[] = {2, 4, 7}
Output: 1
Explanation:
XOR of the array = 2 ^ 4 ^ 7 = 1

Input: arr[] = { 3, 9, 12, 13, 15 }
Output: 4

Approach: In order to find the XOR of all elements in the array, we simply iterate through the array and find the XOR using ‘^’ operator. Therefore, the following steps are followed to compute the answer:



  1. Create a variable to store the XOR of the array as a result.
  2. For each element in the array, find the XOR of the element and the result variable using ‘^’ operator.
  3. Finally, the result variable stores the XOR of all elements in the array.

Below is the implementation of the above approach:

CPP

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to find the XOR of
// all elements in the array
  
#include <bits/stdc++.h>
using namespace std;
  
// Function to find the XOR of
// all elements in the array
int xorOfArray(int arr[], int n)
{
    // Resultant variable
    int xor_arr = 0;
  
    // Iterating through every element in
    // the array
    for (int i = 0; i < n; i++) {
  
        // Find XOR with the result
        xor_arr = xor_arr ^ arr[i];
    }
  
    // Return the XOR
    return xor_arr;
}
  
// Driver Code
int main()
{
  
    int arr[] = { 3, 9, 12, 13, 15 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    // Function call
    cout << xorOfArray(arr, n) << endl;
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to find the XOR of
// all elements in the array
class GFG {
      
    // Function to find the XOR of
    // all elements in the array
    static int xorOfArray(int arr[], int n)
    {
        // Resultant variable
        int xor_arr = 0;
      
        // Iterating through every element in
        // the array
        for (int i = 0; i < n; i++) {
      
            // Find XOR with the result
            xor_arr = xor_arr ^ arr[i];
        }
      
        // Return the XOR
        return xor_arr;
    }
      
    // Driver Code
    public static void main (String[] args)
    {
      
        int arr[] = { 3, 9, 12, 13, 15 };
        int n = arr.length;
      
        // Function call
        System.out.println(xorOfArray(arr, n));
  
    }
}
  
// This code is contributed by Yash_R

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 program to find the XOR of
# all elements in the array
  
# Function to find the XOR of
# all elements in the array
def xorOfArray(arr, n):
  
    # Resultant variable
    xor_arr = 0
  
    # Iterating through every element in
    # the array
    for i in range(n):
  
        # Find XOR with the result
        xor_arr = xor_arr ^ arr[i]
  
    # Return the XOR
    return xor_arr
  
# Driver Code
if __name__ == '__main__':
    arr = [3, 9, 12, 13, 15]
    n = len(arr)
  
    # Function call
    print(xorOfArray(arr, n))
  
# This code is contributed by mohit kumar 29

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to find the XOR of
// all elements in the array
using System;
  
class GFG {
      
    // Function to find the XOR of
    // all elements in the array
    static int xorOfArray(int []arr, int n)
    {
        // Resultant variable
        int xor_arr = 0;
      
        // Iterating through every element in
        // the array
        for (int i = 0; i < n; i++) {
      
            // Find XOR with the result
            xor_arr = xor_arr ^ arr[i];
        }
      
        // Return the XOR
        return xor_arr;
    }
      
    // Driver Code
    public static void Main (string[] args)
    {
      
        int []arr = { 3, 9, 12, 13, 15 };
        int n = arr.Length;
      
        // Function call
        Console.WriteLine(xorOfArray(arr, n));
    }
}
  
// This code is contributed by AnkitRai01

chevron_right


Output:

4

Time Complexity: O(N), where N is the size of the array.

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.




My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.