Bitwise Algorithms

Learn more about Bitwise Algorithms in DSA Self Paced Course
Practice Problems on Bit Magic !
Recent Articles on Bit Magic !

The Bitwise Algorithms is used to perform operations at the bit-level or to manipulate bits in different ways. The bitwise operations are found to be much faster and are sometimes used to improve the efficiency of a program.

For example: To check if a number is even or odd. This can be easily done by using Bitwise-AND(&) operator. If the last bit of the operator is set than it is ODD otherwise it is EVEN. Therefore, if num & 1 not equals to zero than num is ODD otherwise it is EVEN.

Topics:

Introduction:

1. Introduction to Bitwise Algorithms – Data Structures and Algorithms Tutorial
2. Bitwise Operators in C/C++
3. Bitwise Operators in Java
4. Python Bitwise Operators
5. JavaScript Bitwise Operators
6. All about Bit Manipulation
7. Little and Big Endian Mystery

Standard Problems on Bit Algorithms:

• Easy:
  1. Binary representation of a given number
  2. Count set bits in an integer
  3. Add two bit strings
  4. Turn off the rightmost set bit
  5. Rotate bits of a number
  6. Compute modulus division by a power-of-2-number
  7. Find the Number Occurring Odd Number of Times
  8. Program to find whether a no is power of two
  9. Find position of the only set bit
  10. Check for Integer Overflow
  11. Find XOR of two number without using XOR operator
  12. Check if two numbers are equal without using arithmetic and comparison operators
  13. Detect if two integers have opposite signs
  14. How to swap two numbers without using a temporary variable?
  15. Russian Peasant (Multiply two numbers using bitwise operators)
• Medium:
  1. Swap bits in a given number
  2. Smallest of three integers without comparison operators
  3. Compute the minimum or maximum of two integers without branching
  4. Smallest power of 2 greater than or equal to n
  5. Write a C program to find the parity of an unsigned integer
  6. Check if binary representation of a number is palindrome
  7. Generate n-bit Gray Codes
  8. Check if a given number is sparse or not
  9. Euclid’s Algorithm when % and / operations are costly
  10. Calculate square of a number without using *, / and pow()
  11. Cyclic Redundancy Check and Modulo-2 Division
  12. Copy set bits in a range
  13. Check if a number is Bleak
  14. Gray to Binary and Binary to Gray conversion
• Hard:
  1. Next higher number with same number of set bits
  2. Karatsuba algorithm for fast multiplication
  3. Find the maximum subarray XOR in a given array
  4. Find longest sequence of 1’s in binary representation with one flip
  5. Closest (or Next) smaller and greater numbers with same number of set bits
  6. Bitmasking and Dynamic Programming | Set-2 (TSP)
  7. Compute the parity of a number using XOR and table look-up
  8. XOR Encryption by Shifting Plaintext
  9. Count pairs in an array which have at least one digit common
  10. Python program to convert floating to binary
  11. Booth’s Multiplication Algorithm
  12. Number of pairs with Pandigital Concatenation
  13. Find the n-th number whose binary representation is a palindrome
  14. Find the two non-repeating elements in an array of repeating elements

Quick Links :

• Learn Data Structure and Algorithms | DSA Tutorial
• ‘Practice Problems’ on Bit Magic
• ‘Quiz’ on Bit Magic
• ‘Videos’ on Bit Magic

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

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.