CSE373 Autumn 2007

Assignments  Homework 1  Homework 2  Homework 3 part 1  Homework 3 part 2  Homework 4  Homework 5  Homework 6 Exams  Final Exam  Midterm 1  Midterm 2 Administrative  Home  Mailing List  Message Board  Annoucement Archive  Anonymous Feedback  Mail Instructor & TAs Lectures  Calendar & Slides Handouts  Course Info & Syllabus Policies  General Guidelines  Grading Policies  Programming Guidelines  Writen HW Guidelines Computing  JDK 1.6  Eclipse  Programming Lab Info

CSE373 Data Structures Au07, Homework 5 due: At the beginning of class, Monday, Dec 3, 2007 You need to describe each step of the sorting for the following questions Insertion Sort - Weiss 7.1 (p.285) Mergesort - Weiss 7.15 (p.286) Quicksort - Weiss 7.19 (p.286) Describe the worst case for Quicksort and its runtime.