The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. This algorithm is very useful by using the fact that for every integer a and b with a > b: gcd(a,b) = gcd(b, a mod b). First Number: Second Number: Calculate Reset Clear
Lebih seru kalau ditambah fitur untuk bisa generate berkali-kali sesuai input user. Misal kalau user input 5 maka ia akan generate random color 5 kali.
ReplyDeleteTentu saja akan saya kembangkan
ReplyDelete