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
New Topic  
Oughto Oughto
wrote...
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 base case for the algorithm gcd?
A) y > x
B) x < y
C) x == 0
D) y == 0
Textbook 
Starting Out with Java: Early Objects

Starting Out with Java: Early Objects


Edition: 4th
Author:
Read 143 times
2 Replies
Replies
Answer verified by a subject expert
blitheringblithering
wrote...
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...
7 years ago
I literally took this as a gen ed course, I was lost thought it would be easy

thx for making it easier on me
New Topic      
Explore
Post your homework questions and get free online help from our incredible volunteers
  1305 People Browsing
 119 Signed Up Today
Related Images
  
 4427
  
 357
  
 201
Your Opinion
Where do you get your textbooks?
Votes: 372

Previous poll results: What's your favorite coffee beverage?