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) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 - (3842 Reads) |
