摘要
详细叙述了位操作的使用方法,并通过进制转换问题作为实例,阐明了位操作的特点:高效性和简易性。针对使用哈希表过于浪费空间的问题,提出了一个有效的利用被浪费的空间方法,并通过位操作对其算法进行了优化,使得算法快捷、简单、高效。
There are two parts in this paper. The first one is about bit operation. In this part, authors introduced the principle of the bit operation, and also explained how to use bit operation in detail. Bit operation is a very useful way to programme and much more efficient. The second part is about the optimization of storage structure. In that part, a new way to solve the storage problem was advanced while using hash list. And the arithmetic was optimizd with bit operation.
出处
《南京工业大学学报（自然科学版）》
CAS
2003年第5期88-91,共4页
Journal of Nanjing Tech University(Natural Science Edition)
