使用除法(/)，假设这样更清楚。编译器将相应地进行优化。

X = X / 2;是合适的代码使用..但是一个操作取决于你自己的程序，你想要产生怎样的输出。

一般右移分为:

q = i >> n; is the same as: q = i / 2**n;

这有时被用来加快程序的速度，但以清晰度为代价。我觉得你不应该这么做。编译器足够智能，可以自动执行加速。这意味着，以清晰度为代价，你不会获得任何好处。

看看《实用c++编程》的这一页。

使用最能描述您要做的事情的操作。

如果你将数字作为一个比特序列来处理，请使用bitshift。 如果你把它当作一个数值，使用除法。

请注意，它们并不完全相等。对于负整数，它们可以给出不同的结果。例如:

-5 / 2  = -2
-5 >> 1 = -3

(ideone)

第一个看起来像除法吗?不。如果你想除法，用x / 2。如果可能的话，编译器可以优化它使用位移位(它被称为强度减少)，这使得它成为一个无用的微优化，如果你自己做它。

我想说有几件事需要考虑。

Bitshift should be faster, as no special computation is really needed to shift the bits, however as pointed out, there are potential issues with negative numbers. If you are ensured to have positive numbers, and are looking for speed then I would recommend bitshift. The division operator is very easy for humans to read. So if you are looking for code readability, you could use this. Note that the field of compiler optimization has come a long way, so making code easy to read and understand is good practice. Depending on the underlying hardware, operations may have different speeds. Amdal's law is to make the common case fast. So you may have hardware that can perform different operations faster than others. For example, multiplying by 0.5 may be faster than dividing by 2. (Granted you may need to take the floor of the multiplication if you wish to enforce integer division).

如果您追求的是纯粹的性能，我建议您创建一些可以执行数百万次操作的测试。对执行进行多次采样(您的样本量)，以确定哪一个在统计上最适合您的操作系统/硬件/编译器/代码。