Objective

Analyzing the performance of linear search and binary search.

What you need to do

The goal of this take-home exercise is for you to try to verify the big O notation associated with linear search and binary search.  Using the code available in the jar file takeHome1.jar, write a couple of tests (experiments) that try to verify the expected performance for linear search and binary search.  Based on your tests, write a small report (no more than one page) explaining the results of your experiments, and whether you were able to verify the expected performance for each algorithm or not.  Feel free to include a graph with some performance numbers.

You should complete this take-home in a couple of hours.  This take-home counts as a quiz (around 2% of your grade).

Submission

For this project, use the submit server entry Take-Home1 in order to submit a jar file with your take-home.  The jar file must include:

• A pdf file named report.pdf.  This file represents the report you are expected to write.
• The set of tests (experiments) you used to generate your report.  We should be able to run your tests and verify the data you provided in your report.

Web Accessibility