TheAlgorithms
[FEATURE REQUEST] Add New Bit Manipulation Algorithms
What would you like to Propose?
I would like to contribute additional bit manipulation algorithms to the repository. Below are some algorithms I plan to implement:
- Find the Number Appearing Odd Times
- Swap Adjacent Bits of a Number
- Bitwise XOR of All Elements in an Array
Issue details
Algorithm 1: Find the Number Appearing Odd Times In an array where all numbers appear even times except one, we find the number that appears an odd number of times using bit manipulation (XOR).
Algorithm 2: Swap Adjacent Bits of a Number Swap every pair of adjacent bits of a given number.
Algorithm 3: Bitwise XOR of All Elements in an Array Compute the XOR of all elements in an array.
Additional Information
I will ensure the implementation follows the existing coding standards and will include unit tests for each algorithm.
Hey @sanvviratthore , I think the algorithms 1 and 3 are the same / can be solved using same code. Can you explain each of the algorithm further if there is a difference?
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!
![github-actions[bot] avatar](https://avatars.githubusercontent.com/in/15368?v=4 "Published by a pub.dev verified publisher"){kind=small}
Hey, @sanvviratthore
I’d like to propose adding more algorithms, such as:
Count Set Bits in an Integer: Efficiently count the 1s in a binary representation. Reverse Bits of a Number: Reverse the order of bits in a binary number. Looking forward to contributing and discussing further! 😊
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!
Please reopen this issue once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!