CS Behind the Curtain (CS195 2003S)

Homework 5: Generalized Sorting Algorithms

Summary: In this assignment, you will futher your understanding of C, functions, and pointers by implmenting five standard sorting algorithms.

Assigned: Wednesday, 26 February 2003.

Due: Friday, 7 March 2003.

Collaboration: You may discuss this assignment with anyone you wish (although you should cite such discussions). You may implement the work alone, in pairs, or in triplets.

Implementation Language: You must do this assignment in C.

Submitting Your Work: Type your work electronically and submit it via the ECA. If you can't get it to work, email me your source code.


Document, write, and test a program that implements generalized versions of five key array sorting algorithms: insertion sort, selection sort, merge sort, Quicksort, and heap sort. By generalized, I mean that your sorting algorithms should work with different types of values and different mechanisms for ordering those values.



Wednesday, 26 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 Fri May 2 14:19:38 2003.
The source to the document was last modified on Wed Feb 26 13:46:39 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS195/2003S/Homework/hw.05.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu