صندلی اداری

AN EFFECTIVE REALIZATION OF DAYKIN-HARRIS ALGORITHM

Anton Iliev, Nikolay Kyurkchiev, Asen Rahnev, Svetoslav Enkov

Abstract


In this paper we will give how it can be constructed optimized versionof Daykin-Harris algorithm [1], [2] for computing greatest common divisor of two naturalnumbers. This algorithm can be useful for long numbers because of using mainly”subtraction” and ”addition” operations.

Full Text: PDF

Refbacks

  • There are currently no refbacks.
گن لاغری

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

IJDEA, Academic Publications, Ltd.