• be able to analyze the time complexity of algorithms, both sequential and recursive.

You are to explore the impact of selecting various data structures on the exectution time of various operations. You will need to write very little code. Instead, the focus of this assignment is on the analysis of the benchmarking results.

You should compare the following containers: ArrayList<Integer>, SortedArrayList<Integer> (found here), and LinkedList<Integer>. All of these containers implement the List<Integer> interface.

You should compare the time it takes to complete the following operations on each container type:

• Add N (random valued) integers to an empty container.
• Determine whether or not a random integer value is in a container of size N.
• Access the i^th element of a container of size N where i is between 0 and N

You should run all of the tests for a number of values of N. The size of N and the number of specific values of N that you choose to test should be selected so that you are able to accurately predict the growth rate of the operations under examination.

A Benchmarker class has been provided to help expedite your analysis. The class includes the follow methods:

Here is a template file to use as a starting point for this report.

Your report should include:

• Results: You should include at least one plot for each method being analyzed. The plot should be in the form of a .png or .jpg image.
• A discussion of:
  • How you designed your tests;
  • Your results... any surprises?
  • Conclusions based on your results
• The Documented source code for your driver program.
• Be sure to log the time you spend on this project in the FAST system.

As with any report you submit, correct spelling and grammar are required. In addition, your report should be submitted electronically following the Electronic submission guidelines. (You may wish to consult the XML help video and/or sample report before submitting your report.) Be sure to keep copies of all your files, in case something gets lost.

If you have any questions, consult your instructor.

This assignment was originally developed by Dr. Chris Taylor.

© 2001-2006 Dr. Christopher C. Taylor

Office: CC-36C

Phone: 277-7339