TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
Loading...
Searching...
No Matches
count_bits_flip.cpp File Reference

Implementation to [Count number of bits to be flipped to convert A to B] (https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/) in an integer. More...

#include <cassert>
#include <cstdint>
#include <iostream>
Include dependency graph for count_bits_flip.cpp:

Go to the source code of this file.

Namespaces

namespace  bit_manipulation
 for assert
 
namespace  count_bits_flip
 Functions for the count bits flip implementation.
 

Functions

std::uint64_t bit_manipulation::count_bits_flip::countBitsFlip (std::int64_t A, std::int64_t B)
 The main function implements count of bits flip required.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 

Detailed Description

Implementation to [Count number of bits to be flipped to convert A to B] (https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/) in an integer.

We are given two numbers A and B. Our task is to count the number of bits needed to be flipped to convert A to B.

Explanation:

A = 01010 B = 10100 As we can see, the bits of A that need to be flipped are 01010. If we flipthese bits, we get 10100, which is B.

Worst Case Time Complexity: O(log n) Space complexity: O(1)

Author
Yash Raj Singh

Definition in file count_bits_flip.cpp.

Function Documentation

◆ countBitsFlip()

std::uint64_t bit_manipulation::count_bits_flip::countBitsFlip ( std::int64_t A,
std::int64_t B )

The main function implements count of bits flip required.

Parameters
Ais the given number whose bits will be flipped to get number B
Bis the given target number
Returns
total number of bits needed to be flipped to convert A to B

Definition at line 43 of file count_bits_flip.cpp.

45 { // int64_t is preferred over int so that
46 // no Overflow can be there.
47
48 int count =
49 0; // "count" variable is used to count number of bits flip of the
50 // number A to form B in binary representation of number 'n'
51 A = A ^ B;
52 while (A) {
53 A = A & (A - 1);
54 count++;
55 }
56 return count;
57}

◆ main()

int main ( void )

Main function.

Returns
0 on exit

Definition at line 86 of file count_bits_flip.cpp.

86 {
87 test(); // run self-test implementations
88 return 0;
89}
static void test()
Self-test implementations.

◆ test()

static void test ( )
static

Self-test implementations.

Returns
void

Definition at line 65 of file count_bits_flip.cpp.

65 {
66 // A = 10, B = 20 return 4
67 assert(bit_manipulation::count_bits_flip::countBitsFlip(10, 20) == 4);
68 // A = 20, B = 25 return 3
69 assert(bit_manipulation::count_bits_flip::countBitsFlip(20, 25) == 3);
70 // A = 7, B = 10 return 3
71 assert(bit_manipulation::count_bits_flip::countBitsFlip(7, 10) == 3);
72 // A = 17, B = 25 return 1
73 assert(bit_manipulation::count_bits_flip::countBitsFlip(17, 25) == 1);
74 // A = 11, B = 8 return 2
75 assert(bit_manipulation::count_bits_flip::countBitsFlip(11, 8) == 2);
76 // A = 21, B = 22 return 2
77 assert(bit_manipulation::count_bits_flip::countBitsFlip(21, 22) == 2);
78 // A = 7, B = 786 return 5
79 assert(bit_manipulation::count_bits_flip::countBitsFlip(7, 786) == 5);
80 std::cout << "All test cases successfully passed!" << std::endl;
81}