算术移位
在程序设计中，算术移位是一种位操作，有时被称为有符号移位。它分為算术左移和算术右移。对于二进制数来说，算术移位可以移动每個數字的位置，即每個數字都能被移动，而空出的位置又被其他數字填充。当向右移动时，最左边的位置依舊保留原有位置的數值[1]。
参考文献
[编辑]- ^ Thomas R. Cain and Alan T. Sherman. "How to break Gifford's cipher". Section 8.1: "Sticky versus Non-Sticky Bit-shifting". Cryptologia. 1997.
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.
Cover photo is available under {{::mainImage.info.license.name || 'Unknown'}} license.
Cover photo is available under {{::mainImage.info.license.name || 'Unknown'}} license.
Credit:
(see original file).
