Computer Science Fundamentals (CS153 2003S)

Lab Writeup 3: Searching and Sorting

Assigned; Friday, 28 February 2003
Due; Friday, 7 March 2003
No extensions!

Summary: In this assignment, you will write up a variety of exercises relating to searching and sorting.

Purposes: To give you more experience in thinking about algorithm design.

Collaboration: You should work in groups of two or three. You may not work alone. You may not work in groups of four. You may discuss your work and the assignment with anyone you wish. You may obtain help from anyone you wish, but you should clearly document that help (perhaps with an extra citations page).

Helpful References:

Turning it in: Use the ECA's submission service.


Write up the following exercises from the lab on searching, the first lab on sorting, and the second lab on sorting.



Fast Sorting Algorithms



Thursday, 27 February 2003 [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 6 09:20:10 2003.
The source to the document was last modified on Thu Feb 27 22:11:12 2003.
This document may be found at

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

Samuel A. Rebelsky,