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 Test14(int x)
  if (x < 8)
    return (2 * x)
  else
    return (3 * Test14(x - 8) + 8)
end Test14

What is the recursive case for the algorithm?
A) x != 8
B) 2 * x
C) x < 8
D) x >= 8
Textbook 
Starting Out with Java: Early Objects

Starting Out with Java: Early Objects


Edition: 4th
Author:
Read 516 times
4 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
University of Notre Dame

Related Topics

Oughto Author
wrote...
7 years ago
I mentioned in my previous post that I chose this as an elective, thanks for helping me understand
wrote...
6 years ago
thank you
wrote...
4 years ago
Thank you
New Topic      
Explore
Post your homework questions and get free online help from our incredible volunteers
  1075 People Browsing
Related Images
  
 4427
  
 336
  
 8943
Your Opinion