Skip to main content

Bit Manipulation

Bit manipulation represents the elegant and concise facet of algorithms. Apparently, it is based on how the computer stores the information. With such down-to-the-bottom level data structures or operations, the space usage is usually the minimum. The least usage of space makes the speed fast as well.

The unit is bit, which only has two possible values, 0 or 1 (which is exactly the reason that the base is 2, or binary). For the integer data type (int) in most computer system nowadays, there are 32 bits. 

Byte is different from bit. Each byte has 8 bits (so one integer has 4 bytes in size). Thus, the value range of a byte is in [0, 2^8 = 256) (if you know ACII code before, have you ever ask why the range is [0, 256)?). This connects to some very common words used daily,

 1 KB is (2^10 = 1024 ~ 10^3) byte

 1 MB is (2^10 = 1024 ~ 10^3) KB

 1 GB is (2^10 = 1024 ~ 10^3) MB

 1 TB is (2^10 = 1024 ~ 10^3) GB

If we have an integer array with a size of 10^6, the total size is 4*10^6 ~ 4 MB. If you have a movie which is about 100 GB in size, the number of bits in it can also be estimated (homework...).

Now let move on to the negative numbers, which is related to signed numbers. For the signed numbers, the bit on the most left is the flag bit. When it is 0, it is non-negative; when it is 1. it is a negative number. Thus, for the signed integer, the range is [-2^31, 2^31), or

INT_MIN = -2^31

INT_MAX = 2^31 - 1

If you look at the bits of INT_MAX, they are 0111...111, or one 0 + thirty-one 1's;

Then how about INT_MIN?

If this is the first time for you to think about this question, you may guess it may be thirty-two 1's. But actually it is not. It is 1000...000, or one 1 + thirty-one 0's. I know you may ask:

1. why?

2. if this is true, then what is the number with all bits of 1?

The first question is very good one, but I will not try to answer the question here, since it does involve some design logic back to old days of computer. There are good resources online about this. 

For the second question, the answer is -1. (What?) Such a fun world! isn't it?

The next topic is bit-wise operations. The common ones are: & (and), | (or), ^ (xor),  ~ (opposite or NOT), >> (left shift), and <<(rigth shift).

Besides the definitions, pay attention to the precedence of these operators. This will cause some hidden bugs in code if not handle correctly.

Finally we can go to the applications in coding! Yeahhh


Question List


Upper Layer


Comments

Post a Comment

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...
Post a Comment
Read more

Sweep Line

Sweep (or scanning) line algorithm is very efficient for some specific questions involving discrete intervals. The intervals could be the lasting time of events, or the width of a building or an abstract square, etc. In the scanning line algorithm, we usually need to distinguish the start and the end of an interval. After the labeling of the starts and ends, we can sort them together based on the values of the starts and ends. Thus, if there are N intervals in total, we will have 2*N data points (since each interval will contribute 2). The sorting becomes the most time-consuming step, which is O(2N*log(2N) ~ O(N*logN). After the sorting, we usually can run a linear sweep for all the data points. If the data point is labeled as a starting point, it means a new interval is in the processing; when an ending time is reached, it means one of the interval has ended. In such direct way, we can easily figure out how many intervals are in the processes. Other related information can also be obt...
Post a Comment
Read more

Dynamic Programming - Easy Level - Question 1

Dynamic Programming - Easy Level - Question 1 Leetcode 1646  Get Maximum in Generated Array You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2 <= 2 * i <= n nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n Return the maximum integer in the array nums​​​. Constraints: 0 <= n <= 100 Analysis: This question is quick straightforward: the state and transitional formula are given; the initialization is also given. So we can just ready the code to iterate all the states and find the maximum. See the code below: class Solution { public: int getMaximumGenerated(int n) { int res = 0; if(n<2) return n; vector<int> f(n+1, 0); f[1] = 1; for(int i=2; i<=n; ++i) { if(i&1) f[i] = f[i/2] + f[i/2+1]; else f[i] = f[i/2]; // cout<<i<<" "<<f[i]<<endl; ...
Post a Comment
Read more