Fund. CS II (CS152 2006S)

Homework 16: Approximate String Matching

Assigned: Wednesday, April 26, 2006
Due: 8:00 a.m., Friday, April 28, 2006

Summary: In this assignment, you will implement one of the quadratic sorting algorithms.

Purposes: To help you think about the task of sorting. To encourage you to turn abstraction into implementation.



Code Files:

Create a new package for this laboratory entitled username.sorting.

Copy those code files into the package and update the package declaration for each.

The Assignment

Implement and test either selection sort or insertion sort.

Submitting Your Work

Email me your answer. Make sure that the answer is in the body of the email and is not an attachment.



Wednesday, 26 April 2006 [Samuel A. Rebelsky]


Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Tue May 9 08:31:14 2006.
The source to the document was last modified on Wed Apr 26 09:13:14 2006.
This document may be found at

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky,