Download presentation
Presentation is loading. Please wait.
1
Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright © 2006 http://www.cs.Princeton.EDU/IntroCS Recursive GCD Demo public class Euclid { public static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } public static void main(String[] args) { int p = Integer.parseInt(args[0]); int q = Integer.parseInt(args[1]); System.out.println(gcd(p, q)); }
![Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright © Recursive GCD Demo public class Euclid { public static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } public static void main(String[] args) { int p = Integer.parseInt(args[0]); int q = Integer.parseInt(args[1]); System.out.println(gcd(p, q)); }](http://images.slideplayer.com/8/2339024/slides/slide_1.jpg "Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright © Recursive GCD Demo public class Euclid { public static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } public static void main(String[] args) { int p = Integer.parseInt(args[0]); int q = Integer.parseInt(args[1]); System.out.println(gcd(p, q)); }")
2
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment
3
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment
4
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment
5
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) p = 216, q = 192 environment p = 1272, q = 216 environment 1272 = 216 5 + 192
6
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) p = 216, q = 192 environment
7
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) p = 216, q = 192 environment
8
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) environment p = 192, q = 24 p = 216, q = 192 environment p = 1272, q = 216 environment
9
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) environment p = 192, q = 24 p = 216, q = 192 environment p = 1272, q = 216 environment
10
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) environment p = 192, q = 24 p = 216, q = 192 environment p = 1272, q = 216 environment
11
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) environment static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(24, 0) p = 24, q = 0 environment p = 192, q = 24 p = 216, q = 192 environment p = 1272, q = 216 environment
12
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) environment static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(24, 0) p = 24, q = 0 environment p = 192, q = 24 p = 216, q = 192 environment p = 1272, q = 216 environment
13
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) environment static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(24, 0) p = 24, q = 0 environment p = 192, q = 24 p = 216, q = 192 environment p = 1272, q = 216 environment 24
14
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) environment 24 p = 192, q = 24 p = 216, q = 192 environment p = 1272, q = 216 environment
15
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(192, 24) p = 192, q = 24 environment 24 p = 216, q = 192 environment p = 1272, q = 216 environment 24
16
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) 24 p = 216, q = 192 environment p = 1272, q = 216 environment
17
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(216, 192) p = 216, q = 192 environment 24 p = 1272, q = 216 environment 24
18
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) 24 p = 1272, q = 216 environment
19
static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment 24 public class Euclid { public static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } public static void main(String[] args) { int p = Integer.parseInt(args[0]); int q = Integer.parseInt(args[1]); System.out.println(gcd(p, q)); } 24 % java Euclid 1272 216 24
![static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment 24 public class Euclid { public static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } public static void main(String[] args) { int p = Integer.parseInt(args[0]); int q = Integer.parseInt(args[1]); System.out.println(gcd(p, q)); } 24 % java Euclid](http://images.slideplayer.com/8/2339024/slides/slide_19.jpg "static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } gcd(1272, 216) p = 1272, q = 216 environment 24 public class Euclid { public static int gcd(int p, int q) { if (q == 0) return p; else return gcd(q, p % q); } public static void main(String[] args) { int p = Integer.parseInt(args[0]); int q = Integer.parseInt(args[1]); System.out.println(gcd(p, q)); } 24 % java Euclid")
Similar presentations
