Top Posters
Since Sunday
a
5
k
5
c
5
B
5
l
5
C
4
s
4
a
4
t
4
i
4
r
4
r
4
Home Q & A Board Science-Related Homework Help Computer Studies
New Topic  
Oughto Oughto
wrote...
Go to Answer
Posts: 742
Rep: 1 0
7 years ago
Look at the following pseudocode algorithm.

Algorithm gcd(x, y)
  if (x < y)
    gcd (y, x)
  else
    if (y = 0)
      return x
    else
      return gcd(y, x mod y)
end gcd

What is the recursive case for the algorithm gcd?
A) x < y
B) y = 0
C) Both A and B
D) Neither A nor B
Textbook 
Starting Out with Java: Early Objects

Starting Out with Java: Early Objects


Edition: 4th
Author:
Read 126 times
2 Replies
Replies
Answer verified by a subject expert
blitheringblithering
wrote...
#1
Posts: 354
Rep: 9 0
7 years ago
Sign in or Sign up in seconds to unlock everything for free
More solutions for this book are available here
1
University of Notre Dame

Related Topics

Oughto Author
wrote...
#2
7 years ago
I mentioned in my previous post that I chose this as an elective, thanks for helping me understand
New Topic      
Quick Reply
Explore
Post your homework questions and get free online help from our incredible volunteers
  912 People Browsing
Start New Topic Take the Tour CoursesNew Study Tools Topics Trending Browse by Textbook
Live Chat
Related Images
  
 100
  
 357
  
 222
Your Opinion
Which of the following is the best resource to supplement your studies:
Votes: 249
Previous poll results: Which industry do you think artificial intelligence (AI) will impact the most?