Fall 2011
CMSC 351: Homework 8
Clyde Kruskal
Due at the start of class Wednesday, November 9, 2011.
Problem 1.
Illustrate the operation of radix sort on the following list of English words:
ilk, elf, jig, leg, elk, fig, ill, gel, eke, egg, gig, ell
Problem 2.
Suppose that you are given
n
red and
n
blue water jugs, all of different shapes
and sizes. All red jugs hold different amounts of water, as do all blue ones. Moreover,
for every red jug, there is a blue jug that holds the same amount of water, and vice
versa.
It is your task to find a grouping of the jugs into pairs of red and blue jugs that hold
the same amount of water. To do so, you may perform the following operation: pick
a pair of jugs in which one is red and one is blue, fill the red jug with water, and
then pour the water into the blue jug. This operation will tell you whether the red
or the blue jog can hold more water, or if they are of the same volume. Assume that
such a comparison takes one time unit. Your goal is to find an algorithm that makes
a minimum number of comparisons to determine the grouping. Remember that you
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '11
 Staff
 Analysis of algorithms, Clyde Kruskal, blue water jugs, red jugs

Click to edit the document details