C# (CSharp) EuclidianAlgorithms.FindGCD Examples

Example #1

        public int FindGCD_Positive(params int[] numbers)
        {
            long c = 0;

            return(EuclidianAlgorithms.FindGCD(out c, numbers));
        }

Example #2

        public void FindGCD_ArgumentException(params int[] numbers)
        {
            long c = 0;

            Assert.Throws <ArgumentException>(() => EuclidianAlgorithms.FindGCD(out c, numbers));
        }

Example #3

        public int FindGCD_Positive(int a, int b)
        {
            long c = 0;

            return(EuclidianAlgorithms.FindGCD(out c, a, b));
        }