🔒 Closed Python to java code

Status
Not open for further replies.
Pa help naman po paano convert ito convert into a java code...
 

Attachments

  • Tail recursion.webp
    Tail recursion.webp
    6.8 KB · Views: 31
import java.util.*;

public static int find_gcd(int n1, int n2)
{
if(n1 %n2 == 0)
return n2;
else
return find_gcd(n2,(n1%n2));
}
pubic static void main(String[] args) {
int n1,n2;
Scanner kbd = new Scanner(System.in);
System.out.println("Enter 1st number: ");
n1 = kbd.nextInt();
System.out.println("Enter 2nd number: ");
n2 = kbd.nextInt();
System.out.println("The GCD of " + n1 + " and " + n2 + " is " + find_gcd(n1,n2));
}
 
import java.util.*;

public static int find_gcd(int n1, int n2)
{
if(n1==n2)
return n2;
else
return find_gcd(n2,(n1%n2));
}
pubic static void main(String[] args) {
int n1,n2;
Scanner kbd = new Scanner(System.in);
System.out.println("Enter 1st number: ");
n1 = kbd.nextInt();
System.out.println("Enter 2nd number: ");
n2 = kbd.nextInt();
System.out.println("The GCD of " + n1 + " and " + n2 + " is " + find_gcd(n1,n2));
}
lods eto lumabas sa iyong codes
 

Attachments

  • aaaa.webp
    aaaa.webp
    11.7 KB · Views: 22
Status
Not open for further replies.

About this Thread

  • 5
    Replies
  • 578
    Views
  • 2
    Participants
Last reply from:
HELP NYO PO AKO

Trending Topics

Online now

Members online
1,159
Guests online
2,039
Total visitors
3,198

Forum statistics

Threads
2,288,595
Posts
29,052,704
Members
1,214,195
Latest member
Mali ski 0
Back
Top