EECS 587 Homework due September 29, 2015
As always, this homework is due at the start of class.
Throughout this class, you are to do all homework on your own unless told otherwise.
1. Start with the serial program:
1
2
3
4
5
6
7
8
initialize
for i = 0 to

EECS 587 Homework due September 15, 2015
This homework is due at the start of class. We will go over the assignment in class, with volunteers
presenting their solutions. Late assignments will not be accepted. If you cannot attend class that day then
email

Serial Quicksort
Quicksort is an important sorting algorithm. Given an array A(1:n) of items to be sorted, Quicksort(i,j,A)
sorts the items in positions i . . . j. To sort the entire array, the main program calls Quicksort(1,n,A).
Quicksort(i,j,A):
If j

Standard Computer Science Notation and Mathematics
c Quentin F. Stout
lg
ln
n!
n
m
x
x
log base 2
Remember that loga x = loga b logb x.
log base e
n factorial, i.e., n (n 1) . . . 2 1.
n choose m, the number of distinct subsets of m items in a set of n di

Parallel Computing: EECS 587
Quentin F. Stout
3605 CSE
763-1518 qstout@umich.edu
www.eecs.umich.edu/~qstout
Texts: None, but some computer manuals will be used, and there will be various papers, book
excerpts, and web resources.
Course Overview: The cours