Sheet1
Page 1
CS2603 Applied Logic
Homework 10
Due April 15, 3:00pm (bring paper to class and turn it in there)
Late Homework will be not accepted
Problem 1: Prove Theorem(mT) from the lectures on the termination of merge and the relationship between the length of the s
Problem 2: Prove Theorem(dS) about the termination of the deal function and the relationship between the lengths of the seq
Problem 3: Prove Theorem(dR) about guaranteed reduction in the lengths of the sequences in the pair that the deal function d
Problem 4: Prove that if qsort satisfies the equations specified in the lectures, it terminates and delivers a sequence of the sam
Problem 5: Prove that if qsort satisfies the equations specified in the lectures and if x is an element of the sequence xs, then x
Problem 6: Chart the performance of msort, qsort, and isort by running them on sequences of increasing length, measuring th
You can use a crude timing method, such as the traditional "thousand one ... thousand two ..." or a stopwatch. The module W
http://www.cs.ou.edu/~rlpage/DMtools/ALhw/WordsOfSteele.hs
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '08
 RexPage

Click to edit the document details