Advanced Search

Question: Greatest Common Divisor - igcd

Question:Greatest Common Divisor - igcd

maplenoob 189 Maple
student
November 03 2008
0

hi

 

i made an implementation of the euklid algo (rekusiv and iterativ) und meassured the time that was needed to calculate the gcd. even for big numbers really fast, but if i use the maple command igcd i get a runtime that is far longer then the time i get with my own implementation.

how does that come ? what algo does maple use the calculate the gcd ?

anyone knows?

thx for reply
Please Wait...