基于字符数组的超长整数四则运算算法研究  

Research of Very Long Integer Arithmetic Algorithms Based on Character Array

作　　者：胡凤国[1] 

机构地区：[1]中国传媒大学应用语言学研究所,北京100024

出　　处：《现代电子技术》2010年第20期127-132,共6页Modern Electronics Technique

基　　金：国家社会科学基金资助项目(09BYY024);中国传媒大学"211工程"三期重点学科建设项目(21103010101)

摘　　要：通过对现有超长整数四则运算的算法的综合比较,提出一套相对完善的算法的设计目标。基于字符数组提出一套无符号超长整数四则运算算法,给出了加减乘除4个算法的逻辑思路和程序代码,精确实现了超长整数的四则运算,并将算法应用于科学研究的实践当中。The design objective of a set of relatively perfect algorithms is proposed by comprehensively comparing the several algorithms of very long integer arithmetic, and a set of unsigned very long integer arithmetic algorithms based on character array is introduced. There are logic plans and programming source codes of the four arithmetic operations （addition, subtraction, multiplication and division） among the algorithms are given. The exact results of very long integer arithmetic can be obtained by using the set of algorithms, which have been applied to a calculation task in a scientific research work.

关 键 词：超长整数 四则运算 字符数组 算法 

分 类 号：TN919-34[电子电信—通信与信息系统] TP311[电子电信—信息与通信工程]