|File size:||8,81 KB (9021 B)|
|Description:||Efficient method for computing the greatest common divisor (GCD), also known as the greatest common factor (GCF) or highest common factor (HCF). The algorithm is also called Euclid's algorithm.
User fills in two numbers to find out the GCD. This is a simple Numeric example, that uses While Loop inside.|
|Author of the file:||smath (Andrey Ivashov)|
|Date of publish:||27.05.2013 2:48:17|
|Resource status: ||AvailableFreeLatest versionApprovedStable version|
|Statistics||downloads: 443 (total for all versions of the file: 443)|
|Actions:||Download Open Statistics|
This feature is not activated. Please try again later.