Mega Code Archive
(Shift Right with Sign)
<![CDATA[
The shift right with sign operator looks at the integer to the left of the operator, num1, as a 32-bit binary number.
All the bits in this number are shifted to the right by the number of positions specified by num2.
If the original number is positive, zeros are added to the left side of the binary number.
If the original number is negative, ones are used.
The extra bits on the right are lost.
The 32-bit binary result of shifting operation is converted to an integer value and returned from the shift right with sign operation.
The result generated from the shift right with sign operator can be quickly calculated by dividing the number by 2 raised to the x power, where x is the number of positions shifted. Discard the remainder.
<html>
<script language="JavaScript">
<!--
// 14 = 00000000000000000000000000001110
// 3 = 00000000000000000000000000000011
x = 14 >> 2;
document.write("14 >> 2 = ",x);
document.write("<br>");
// -4 = 11111111111111111111111111111100
// -2 = 11111111111111111111111111111110
y = -4 >> 1; //y is equal to -2
document.write("-4 >> 2 = ",y);
-->
</script>
</html>
]]>