Description
Introduction
For this assignment you will add a recursive binary search algorithm to the existing starter code provided
in Canvas. Once you get your code running, you will use it to compare the growth rate of a linear search
vs. a binary search algorithm for data sets of increasing sizes.
Add your code to locations in LwtSearch.java, and SearchExamples.java that are marked with a single
line comment (“//”) delimiter followed by the string “TODO”. You may add methods and fields to this
class, but do not change the signature or return type of LwtSearch.linearSearch or
LwtSearch.binarySearch.
The Output
Create a Java project named Searching, using the starter files. Before you add any code, run the project
and notice the format of the output. The output from your binary search method should follow the same
pattern.
Upload The Java Files
When you are finished with the assignment, upload the .java files only. Do not upload the entire project,
or any other files in it. Just the .java files.
Notice that this assignment has a Rubric.
5/6/2020 Programming Assignment 1 – Logarithmic Running Time
https://lwtech.instructure.com/courses/1940982/assignments/18442775?module_item_id=42539516 2/2
Total Points: 100.0
Criteria Ratings Pts
70.0 pts
15.0 pts
15.0 pts
Meet all of the requirements
The program meets all of the requirements of the problem statement(s). The software that is
submitted compiles without error, and runs without throwing any exceptions.
The source code is formatted consistently and is well commented.
Each file submitted has a block comment at the top of the file that includes the author’s
name, the class ID, assignment number, and a brief description of the contents of the file.
Functional blocks of code have a block comment at the beginning.
the code has been tested
There are sufficient number of tests to verify that the program meets the requirements of the
assignment.
