C# (CSharp) GCDAlgorithms.BinaryGreatestCommonDivisor Exemples

Exemple #1

 public static void FindGcdByStein_IntMinValue_ArgumentExeption()
 {
     Assert.Throws <ArgumentException>(() => GCDAlgorithms.BinaryGreatestCommonDivisor(int.MaxValue, int.MinValue));
 }

Exemple #2

 public static int FindGcdByStein_Params_GCD(params int[] numbers)
 {
     return(GCDAlgorithms.BinaryGreatestCommonDivisor(numbers));
 }

Exemple #3

 public static void FindGcdByStein_ZeroParams_ArgumentExeption()
 {
     Assert.Throws <ArgumentException>(() => GCDAlgorithms.BinaryGreatestCommonDivisor(0, 0, 0, 0, 0, 0, 0));
 }

Exemple #4

 public static int FindGcdByStein_TwoNumbers_GCD(int val1, int val2)
 {
     return(GCDAlgorithms.BinaryGreatestCommonDivisor(val1, val2));
 }