论文信息 - Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny

Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny

Before the era of ubiquitous computers, the long-division method was presented in primary schools as a paper-and-pencil technique to do whole-number division. In the book “Hacker’s Delight” by Warren [2nd edition, 2013], an implementation of this algorithm was given using the C programming language. In this paper we will report our experiences when converting this program to a generic program-library routine.

Jyrki Katajainen

[1] Per Brinch Hansen,et al. Multiple‐length division revisited: A tour of the minefield , 1994, Softw. Pract. Exp..

[2] Henry S. Warren,et al. Hacker's Delight , 2002 .

[3] Lay Yong Lam. The Development of Hindu-Arabic and Traditional Chinese Arithmetic , 1996 .

[4] Charles J. Mifsud,et al. Addendum to a multiple-precision division algorithm , 1973, CACM.

[5] Jyrki Katajainen,et al. Convex-Hull Algorithms: Implementation, Testing, and Experimentation , 2018, Algorithms.

[6] Charles J. Mifsud. A multiple-precision division algorithm , 1970, CACM.

[7] David A. Pope,et al. Multiple precision arithmetic , 1960, CACM.

[8] Lam Lay-Yong,et al. On the Chinese Origin of the Galley Method of Arithmetical Division , 1966 .

[9] David R. Musser,et al. Analysis of the Pope-Stein Division Algorithm , 1977, Information Processing Letters.

[10] E. V. Krishnamurthy,et al. On the normalization requirement of divisor in divide-and-correct methods , 1967, CACM.