mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-22 21:57:35 +00:00
Code Issues Packages Projects Releases Wiki Activity
Python/bit_manipulation
History
parth-6945 cc621f1fdd
Add find_unique_number algorithm to bit manipulation (#12654) 
* Add find_unique_number algorithm to bit manipulation

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
2025-04-14 21:01:29 +03:00
..
__init__.py
Add __init__.py files in all the directories (#2503)
2020-09-28 19:42:36 +02:00
binary_and_operator.py
use format to remove '0b' (#11307)
2024-06-01 18:41:40 -07:00
binary_coded_decimal.py
Add binary_coded_decimal.py (#10656)
2023-10-18 00:37:57 +02:00
binary_count_setbits.py
added binary_count_trailing_zeros.py (#2557)
2020-11-26 09:27:00 +08:00
binary_count_trailing_zeros.py
added binary_count_trailing_zeros.py (#2557)
2020-11-26 09:27:00 +08:00
binary_or_operator.py
Fix typos in Sorts and Bit_manipulation (#4949)
2021-10-20 16:42:32 +08:00
binary_shifts.py
refactor: Remove unnecessary if else condition (#4307)
2021-04-04 09:30:17 +05:30
binary_twos_complement.py
Added binary shifts and twos complement functions to bit manipulation (#4068)
2021-02-23 11:45:00 +05:30
binary_xor_operator.py
Fix typos in Sorts and Bit_manipulation (#4949)
2021-10-20 16:42:32 +08:00
bitwise_addition_recursive.py
Move bitwise add (#9097)
2023-09-27 15:54:40 +02:00
count_1s_brian_kernighan_method.py
Fix argument validation for count_1s_brian_kernighan_method (#7994)
2022-11-20 23:59:25 +13:00
count_number_of_one_bits.py
Fix benchmark to test with the provided number instead on 25 (#10587)
2023-10-16 10:48:26 -04:00
excess_3_code.py
Excess 3 code (#11001)
2023-10-27 23:48:15 +02:00
find_previous_power_of_two.py
Create find_previous_power_of_two.py (#11004)
2023-10-29 11:25:39 +01:00
find_unique_number.py
Add find_unique_number algorithm to bit manipulation (#12654)
2025-04-14 21:01:29 +03:00
gray_code_sequence.py
Add a gray_code_sequence.py file to the bit_manipulation folder (#5038)
2021-11-02 18:13:49 +08:00
highest_set_bit.py
Add function for highest set bit location (#7586)
2022-10-26 22:09:23 +02:00
index_of_rightmost_set_bit.py
fix validation condition and add tests (#7997)
2022-11-29 19:07:27 +01:00
is_even.py
Typo deicmal -> decimal (#11169)
2023-11-25 12:25:46 +01:00
is_power_of_two.py
Is power of two (#7936)
2022-11-01 18:43:03 +01:00
largest_pow_of_two_le_num.py
Added largest pow of 2 le num (#9374)
2023-10-05 21:37:23 +13:00
missing_number.py
test: adding more tests to missing number algorithm (#10394)
2023-10-29 22:43:32 +01:00
numbers_different_signs.py
add numbers different signs algorithm. (#8008)
2022-12-15 17:11:32 +13:00
power_of_4.py
Power of 4 (#9505)
2023-10-09 08:40:14 +13:00
README.md
Add README files 1/7 (#5754)
2021-11-04 18:49:36 +08:00
reverse_bits.py
[pre-commit.ci] pre-commit autoupdate (#9013)
2023-08-29 15:18:10 +02:00
single_bit_manipulation_operations.py
Enable ruff RUF002 rule (#11377)
2024-04-22 21:51:47 +02:00
swap_all_odd_and_even_bits.py
Create swap_all_odd_and_even_bits.py (#10692)
2023-10-19 19:49:47 +02:00

README.md

Bit manipulation

Bit manipulation is the act of manipulating bits to detect errors (hamming code), encrypts and decrypts messages (more on that in the 'ciphers' folder) or just do anything at the lowest level of your computer.