Question
Recursion The largest power of two less than (10 pts) Implement the method public static int lp2lt(int n), which calculates and returns the largest integer
Recursion
The largest power of two less than (10 pts)
Implement the method public static int lp2lt(int n), which calculates and returns the
largest integer power of 2 less than n. You may assume n is greater than 1. For example, if n is 10, the
largest power of 2 less than n is 8 (8 is 2 cubed). If n is 8, the answer is 4. If n is 2, 2^0 = 1.
You may not make use of any Java classes other than incidental use of Strings, calls to
System.out.println, and accessing an existing array passed to your method. The tester program will
verify that your program contains no imports, no use of "new", and the only uses of . (dot) are within
calls to System.out.println, accessing array .length, or followed by a digit (double literals).
You may not use for or while. Any looping must be accomplished using recursion. The tester
program will check for no "for"s or "while"s and may be triggered by the word in a comment.
You may not declare static or non-static member fields - only local or parameter variables allowed.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started