Finding the Parity of a number Efficiently
Given an integer N. The task is to write a program to find the parity of the given number.
Note: Parity of a number is used to define if the total number of set-bits(1-bit in binary representation) in a number is even or odd. If the total number of set-bits in the binary representation of a number is even then the number is said to have even parity, otherwise, it will have odd parity.
Examples:
Input : N = 13 Output : Odd Parity Bianry representation of 13 is (1101) Input : N = 9 (1001) Output : Even Parity
The parity of a number represented by 32-bits can be efficiently calculated by performing the following operations.
Let the given number be x, then perform the below operations:
- y = x^(x>>1)
- y = y^(y>>2)
- y = y^(y>>4)
- y = y^(y>>8)
- y = y^(y>>16)
Now, the rightmost bit in y will represent the parity of x. If the rightmost bit is 1, then x will have odd parity and if it is 0 then x will have even parity.
So, in order to extract the last bit of y, perform bit-wise AND operation of y with 1.
if(y&1==1)
odd Parity
else
even Parity
Below is the implementation of the above approach:
C++
// Program to find the parity of a given number #include <bits/stdc++.h> using namespace std; // Function to find the parity bool findParity(int x) { int y = x ^ (x >> 1); y = y ^ (y >> 2); y = y ^ (y >> 4); y = y ^ (y >> 8); y = y ^ (y >> 16); // Rightmost bit of y holds the parity value // if (y&1) is 1 then parity is odd else even if (y & 1) return 1; return 0; } // Driver code int main() { (findParity(9)==0)?cout<<"Even Parity\n": cout<<"Odd Parity\n"; (findParity(13)==0)?cout<<"Even Parity\n": cout<<"Odd Parity\n"; return 0; } |
chevron_right
filter_none
Java
// Program to find the // parity of a given number import java.io.*; class GFG { // Function to find the parity static boolean findParity(int x) { int y = x ^ (x >> 1); y = y ^ (y >> 2); y = y ^ (y >> 4); y = y ^ (y >> 8); y = y ^ (y >> 16); // Rightmost bit of y holds // the parity value // if (y&1) is 1 then parity // is odd else even if ((y & 1) > 0) return true; return false; } // Driver code public static void main (String[] args) { if((findParity(9) == false)) System.out.println("Even Parity"); else System.out.println("Odd Parity"); if(findParity(13) == false) System.out.println("Even Parity"); else System.out.println("Odd Parity"); } } // This Code is Contributed by chandan_jnu. |
chevron_right
filter_none
Python3
# Program to find the # parity of a given number # Function to find the parity def findParity(x): y = x ^ (x >> 1); y = y ^ (y >> 2); y = y ^ (y >> 4); y = y ^ (y >> 8); y = y ^ (y >> 16); # Rightmost bit of y holds # the parity value if (y&1) # is 1 then parity is odd # else even if (y & 1): return 1; return 0; # Driver code if(findParity(9) == 0): print("Even Parity"); else: print("Odd Parity\n"); if(findParity(13) == 0): print("Even Parity"); else: print("Odd Parity"); # This code is contributed by mits |
chevron_right
filter_none
C#
// Program to find the // parity of a given number using System; class GFG { // Function to find the parity static bool findParity(int x) { int y = x ^ (x >> 1); y = y ^ (y >> 2); y = y ^ (y >> 4); y = y ^ (y >> 8); y = y ^ (y >> 16); // Rightmost bit of y holds // the parity value // if (y&1) is 1 then parity // is odd else even if ((y & 1) > 0) return true; return false; } // Driver code public static void Main () { if((findParity(9) == false)) Console.WriteLine("Even Parity"); else Console.WriteLine("Odd Parity"); if(findParity(13) == false) Console.WriteLine("Even Parity"); else Console.WriteLine("Odd Parity"); } } // This Code is Contributed // by chandan_jnu |
chevron_right
filter_none
PHP
<?php // Program to find the // parity of a given number // Function to find the parity function findParity($x) { $y = $x ^ ($x >> 1); $y = $y ^ ($y >> 2); $y = $y ^ ($y >> 4); $y = $y ^ ($y >> 8); $y = $y ^ ($y >> 16); // Rightmost bit of y holds // the parity value if (y&1) // is 1 then parity is odd // else even if ($y & 1) return 1; return 0; } // Driver code (findParity(9) == 0) ? print("Even Parity\n"): print("Odd Parity\n"); (findParity(13) == 0) ? print("Even Parity\n"): print("Odd Parity\n"); // This Code is Contributed by mits ?> |
chevron_right
filter_none
Output:
Even Parity Odd Parity
Recommended Posts:
- Compute the parity of a number using XOR and table look-up
- Program to invert bits of a number Efficiently
- Program to find parity
- Sum of elements from an array having even parity
- Count the nodes in the given tree whose weight is even parity
- Check if matrix A can be converted to B by changing parity of corner elements of any submatrix
- Efficiently check whether n is a multiple of 4 or not
- Writing C/C++ code efficiently in Competitive programming
- Efficiently check if a string has all unique characters without using any additional data structure
- Efficiently find first repeated character in a string without using any additional data structure in one traversal
- std::gcd | C++ inbuilt function for finding GCD
- Finding Floor and Ceil of a Sorted Array using C++ STL
- Finding inverse of a matrix using Gauss - Jordan Method | Set 2
- Maximize a given unsigned number number by swapping bits at it's extreme positions.
- Count number of trailing zeros in Binary representation of a number using Bitset
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.
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Sum of all Submatrices of a Given Matrix
- Choose atleast two elements from array such that their GCD is 1 and cost is minimum
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Interactive Problems in Competitive Programming
