• Be able to use generic algorithms from the STL and implement additional generic algorithms.
• Be able to apply asymptotic time complexity analysis to choose among competing algorithms.
• Understand how sorting algorithms such as heapsort and quicksort work.

This lab assignment is designed to provide insight into the implementation of various sorting algorithms and generic algorithms.

You should implement three generic sorting algorithms (they should have the same interface as the generic sort algorithm). You should implement InsertionSort, QuickSort, and a hybrid sort that uses QuickSort on any partition with more than 20 elements and InsertionSort for partitions with 20 or fewer elements. One algorithm should require only bi-directional iterators while the others may require 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 of your sorting algorithms as well as the generic sort algorithm and the list's sort algorithm (be sure to fix it first) by exercising all of them. You may find the benchmark class useful in your comparisons.

Each pair should submit one lab report. Your report should include:

• A table with the time results of the comparisons
• Discussion containing:
  • An analysis of appropriate patterns
  • A comparison between the different sorting algorithms
  • Your experience/impressions of the CSP
  • How you an your partner worked (or didn't work) together
  • Any problems you encountered
  • Etc...
• Conclusions (what you learned, suggestions of how the lab could be improved, things you would have done differently, etc.)
• CSP spreadsheet (Use naming convention: 385MSOEloginL2.xls. Begin with a new spreadsheet. Use your best judgement in establishing an initial baseline based on the PSP data from each of you individually. Be sure to justify your methodology (in your report) for establishing your baseline.)
• You may enter data into the XML formatted Activity and Defect logs or submit an additional spreadsheet with this data. (Use naming convention: 385MSOEloginL2b.xls.)
• Documented source code

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.

If you have any questions, consult the instructor.

© 2001-2006 Dr. Christopher C. Taylor

Office: CC-36C

Phone: 277-7339