| CS286 -- Lab 2: Sorting Algorithms |
|
|
PurposeThis lab assignment is designed to provide insight into the implementation of various sorting algorithms and generic algorithms. AssignmentYou should implement two generic sorting algorithms. You should implement InsertionSort and HeapSort. One algorithm should require only bi-directional iterators while the other may use random access iterators. The sorting algorithms should work on any container (with the appropriate iterators available) containing any type of object for which the less than operator is defined. In addition, you should write a test program that sorts the words in words.txt. The program should compare all both of your sorting algorithms as well as the generic sort algorithm and the list's sort algorithm by exercising all of them. You may find the benchmark class useful in your comparisons. Lab report (due 11:00pm, the day prior to week 4 lab)Each pair should submit one lab report. The report should be self-contained. That is, it should be possible for someone to understand what you did and why without seeing anything other than your report. Your report should 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 sample report before submitting your report.) Be sure to keep copies of all your files, in case something gets lost. It may be wise to keep a diskette backup as well. If you have any questions, consult the instructor. |
| © 2001 Dr. Christopher C. Taylor | Office: CC-27C | Phone: 277-7339 | Last Updated: March 7, 2001 |
| I am responsible for all content posted on these pages; MSOE is welcome to share these opinions but may not want to. | |||