Parity: Parity of a number refers to whether it contains an odd or even number of 1-bits. The number has “odd parity”, if it contains odd number of 1-bits and is “even parity” if it contains even number of 1-bits.
Main idea of the below solution is – Loop while n is not 0 and in loop unset one of the set bits and invert parity.
Algorithm: getParity(n) 1. Initialize parity = 0 2. Loop while n != 0 a. Invert parity parity = !parity b. Unset rightmost set bit n = n & (n-1) 3. return parity Example: Initialize: n = 13 (1101) parity = 0 n = 13 & 12 = 12 (1100) parity = 1 n = 12 & 11 = 8 (1000) parity = 0 n = 8 & 7 = 0 (0000) parity = 1
Parity of no 7 = odd
Above solution can be optimized by using lookup table. Please refer to Bit Twiddle Hacks[1st reference] for details.
Time Complexity: The time taken by above algorithm is proportional to the number of bits set. Worst case complexity is O(Log n).
Uses: Parity is used in error detection and cryptography.
http://graphics.stanford.edu/~seander/bithacks.html#ParityNaive – last checked on 30 May 2009.
- Sum of elements from an array having even parity
- Longest alternative parity subsequence
- Finding the Parity of a number Efficiently
- Compute the parity of a number using XOR and table look-up
- Count numbers which can be represented as sum of same parity primes
- Check if matrix A can be converted to B by changing parity of corner elements of any submatrix
- Minimum operations required to modify the array such that parity of adjacent elements is different
- Program to find sum of 1 + x/2! + x^2/3! +...+x^n/(n+1)!
- Program to find GCD or HCF of two numbers
- Program to find LCM of two numbers
- Program to find the sum of a Series 1/1! + 2/2! + 3/3! + 4/4! +.......+ n/n!
- Program to find the last two digits of x^y
- Program to find the value of tan(nΘ)
- Program to Find the value of cos(nΘ)
- Program to find Sum of a Series a^1/1! + a^2/2! + a^3/3! + a^4/4! +…….+ a^n/n!