C-Plus-Plus
C-Plus-Plus copied to clipboard
feat: count set bits using lookup table
Description of Change
Checklist
- [x] Added description of change
- [x] Added file name matches File name guidelines
- [x] Added tests and example, test must pass
- [x] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
- [x] Relevant documentation/comments is changed or added
- [x] PR title follows semantic commit guidelines
- [x] Search previous suggestions before making a new one, as yours may be a duplicate.
- [x] I acknowledge that all my contributions will be made under the project's license.
Notes: Proposed an algorithm that counts set bits in an integer in O(1) time using a lookup table that is generated during compile time. Also, it is more efficient than the one already present and has a space complexity of O(1)
done, pls review @Panquesito7
HI @Panquesito7 . it's been 3 days since our last discussion. Please let me know if any other changes are required from my side.
Do you still want to work on this PR?