Outcomes Addressed
Team AssignmentStudents should work with their assigned partner(s) on this assignment. OverviewThis lab assignment is designed to provide insight into the implementation of various sorting algorithms and generic algorithms. Problem StatementYou must implement three sorting algorithms (they should have the same interface as the Collections.sort(List<T> list) algorithm). You must implement InsertionSort, QuickSort, and MergeSort. The sorting algorithms should work on any List<T> where T implements the Comparable interface. In addition, you must write a test program that sorts the words in words.txt. The program should compare all of your sorting algorithms as well as the Collections.sort(List<T> list) algorithm on the following two containers: ArrayList<String> and LinkedList<String>. Intermediate Deliverable (due one hour prior to week 4 lab)You must be prepared to demonstrate benchmarking the Collections.sort() method and your implementation of InsertionSort. Lab report (due 11:00pm, Monday of week 5)Here is a template file to use as a starting point for this report. Your report must include:
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. AcknowledgmentThis laboratory was developed by Dr. Chris Taylor. |