홈 > Term: greatest common divisor (GCD)
greatest common divisor (GCD)
(1) The greatest integer which is a divisor of given positive integers. For instance, GCD(30, 42) = 6. (2) An algorithm to find the same.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
-
(Gold) 1123 포인트 - 100% positive feedback
