Euclid' s Algorithm
(Or "Euclidean Algorithm") An algorithm for finding the greatest common divisor (GCD) of two numbers. It relies on the identity gcd(a, b) = gcd(a-b, b) To find the GCD of two numbers by this algorithm, repeatedly replace the larger by subtracting the smaller from it until the two numbers are equal. E.g. 132, 168 -> 132, 36 -> 96, 36 -> 60, 36 -> 24, 36 -> 24, 12 -> 12, 12 so the GCD of 132 and 168 is 12. This algorithm requires only subtraction and comparison operations but can take a number of steps proportional to the difference between the initial numbers (e.g. gcd(1, 1001) will take 1000 steps). (1997-06-30) In addition suitable contents:
[ 2 ] [ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ at ] [ b ] [ be ] [ bt ] [ by ] [ C ] [ ca ] [ CD ] [ cd ] [ ch ] [ cl ] [ co ] [ com ] [ D ] [ de ] [ diff ] [ ding ] [ divisor ] [ du ] [ E ] [ ed ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ Euclid ] [ Euclidean Algorithm ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ G ] [ GC ] [ ge ] [ gr ] [ greatest common divisor ] [ h ] [ hm ] [ hr ] [ id ] [ ie ] [ iff ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ la ] [ Lex ] [ li ] [ ly ] [ ma ] [ mall ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ng ] [ ni ] [ nl ] [ ns ] [ nu ] [ numbers ] [ O ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pl ] [ port ] [ pr ] [ query ] [ rc ] [ re ] [ repeat ] [ ro ] [ se ] [ sm ] [ so ] [ st ] [ su ] [ T ] [ test ] [ th ] [ to ] [ tr ] [ tw ] [ ua ] [ um ] [ vi ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3782 Reads) |
