Download code

Jump to: navigation, search

Back to Euclidean_algorithm_(Java,_recursive)

Download for Windows: single file, zip

Download for UNIX: single file, zip, tar.gz, tar.bz2

Euclid.java

 1 /* The authors of this work have released all rights to it and placed it
 2 in the public domain under the Creative Commons CC0 1.0 waiver
 3 (http://creativecommons.org/publicdomain/zero/1.0/).
 4 
 5 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 6 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 7 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 8 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
 9 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
10 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
11 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
12 
13 Retrieved from: http://en.literateprograms.org/Euclidean_algorithm_(Java,_recursive)?oldid=16782
14 */
15 
16 
17 public class Euclid
18 {
19     public static long gcd(long a, long b)
20     {
21         if (b == 0) return a;
22         else return gcd(b, a % b);
23     }
24 
25 
26     public static void main(String[] args)
27     {
28         long n0 = Long.parseLong(args[0]);
29         long n1 = Long.parseLong(args[1]);
30 
31         long res;
32         if (n0 > n1)
33             res = gcd(n0, n1);
34         else if (n1 > n0)
35             res = gcd(n1, n0);
36         else
37             res = n0;
38 
39         System.out.println(res);
40     }
41 }


hijacker
hijacker
hijacker
hijacker