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:

• Instructions for Laboratory Writeups
• Reading on Preconditions and Postconditions
• Reading on Searching.
• Reading on Sorting.
• Reading on Merge Sort.
• Reading on Quicksort.

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

Assignment

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

Searching

• Exercise 2: Extending sequential-search-vector.

Sorting

• Exercise 8: Inserting into Vectors.
• Exercise 9: Testing Vector-Based Insertion Sort.

Fast Sorting Algorithms

• Exercise 5: Special Cases
• Exercise 7: Quicksorting lists.
• Exercise 9: Improving Quicksort.
• Exercise 10: Verifying sorts.