Session
Computer Science and Communication Engineering
Description
Euclid’s algorithm remains to be the most efficient method for finding greatest common divisor of two full numbers. By using the meaning of congruences this research paper will make a modification in the note of the Euclid’s algorithm. Here are discussed both classic and modified methods, by putting appropriate codes and observe the duration of the calculation through the computer.
Keywords:
Algorithm, Euclid, GCD, modification, congruence
Session Chair
Bertan Karahoda
Session Co-Chair
Krenare Pireva
Proceedings Editor
Edmond Hajrizi
ISBN
978-9951-437-69-1
Location
Pristina, Kosovo
Start Date
27-10-2018 10:45 AM
End Date
27-10-2018 12:15 PM
DOI
10.33107/ubt-ic.2018.90
Recommended Citation
Emini, Emin; Jusufi, Azir; and Emini, Ruhada, "Efficiency of calculating GCD through computer with help of modified Euclidean algorithm" (2018). UBT International Conference. 90.
https://knowledgecenter.ubt-uni.net/conference/2018/all-events/90
Efficiency of calculating GCD through computer with help of modified Euclidean algorithm
Pristina, Kosovo
Euclid’s algorithm remains to be the most efficient method for finding greatest common divisor of two full numbers. By using the meaning of congruences this research paper will make a modification in the note of the Euclid’s algorithm. Here are discussed both classic and modified methods, by putting appropriate codes and observe the duration of the calculation through the computer.