lab4 - CSS 342: Mathematical Principles of Computing Lab 4:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSS 342: Mathematical Principles of Computing Lab 4: Sorting - Quicksort Professor: Munehiro Fukuda Assigned: See Our Syllabus Purpose This laboraotry work explores quicksort by arranging its algorithm to find the top k items, the bottom k items, and the median. Partial Sorting Sometimes we are interested in a partially sorted data set. For example, we might need to know the top 10 best sellers, the 20 highest-grossing movies, or the top 10% students by GPA. These partial sets can be obtained without completing quicksort on an entire data set, in other words, just by performing quicksort for the first several partiions in a particular range. Statement of Work This is a group work. Form a group of two students. (If you can't find a partner, you may form a group of three.) Decide which problem your group solve, using the following formula: (1) calculate the sum of all the group members' student IDs, (say N ); and (2) calculate the remainder of N / 3, (say Q = N % 3 ). Choose one of the following three questioins corresponding to your group's
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 12/20/2009.

Page1 / 2

lab4 - CSS 342: Mathematical Principles of Computing Lab 4:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online