Problem 25

Subject: Problem 25
From: Matthew Cary (cary@cs.washington.edu)
Date: Wed Apr 17 2002 - 13:37:44 PDT

• sorted by: [ date ] [ thread ] [ subject ] [ author ]
• Next message: James Nicholas Deibel: "Locatives"
• Previous message: Kevin Chan: "Comments on the README"

For problem 24 in chapter 11, sorting n m-bit numbers in time O(n), note
that O(nm) is *not* O(n) time. Your running time should *not* depend on
m; this is why the comparison time assumption is necessary. The
solution does not necessarily involve sorting anything.

Also, the lecture 6 slides on the web have been replaced with a version
including the slide that was purposefully omitted from the printed
handout.

Matt

• Next message: James Nicholas Deibel: "Locatives"
• Previous message: Kevin Chan: "Comments on the README"

This archive was generated by hypermail 2b25 : Wed Apr 17 2002 - 13:37:55 PDT