Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Design and implement a stable version of the bucket-sort algorithm for sorting a
sequence of n elements with integer keys taken from the range [0,N − 1], for N
≥ 2. The algorithm should run in O(n + N) time.
P-11.3
Implement merge-sort and deterministic quick-sort and perform a series of
benchmarking tests to see which one is faster. Your tests should include
sequences that are "random" as well as "almost" sorted.
P-11.4
Implement deterministic and randomized versions of the quick-sort algorithm
and perform a series of benchmarking tests to see which one is faster. Your tests
should include sequences that are very "random" looking as well as ones that
are "almost" sorted.
P-11.5
Implement an in-place version of insertion-sort and an in-place version of
quick-sort. Perform benchmarking tests to determine the range of values of n
where quick-sort is on average better than insertion-sort.
P-11.6
Design and implement an animation for one of the sorting algorithms described
in this chapter. Your animation should illustrate the key properties of this
algorithm in an intuitive manner.
P-11.7
Implement the randomized quick-sort and quick-select algorithms, and design a
series of experiments to test their relative speeds.
P-11.8
Implement an extended set ADT that includes the methods union(B),
intersect(B), subtract(B), size(), isEmpty(), plus the methods equals(B),
contains(e), insert(e), and remove(e) with obvious meaning.
P-11.9
Implement the tree-based union/find partition data structure with both the
union-by-size and path-compression heuristics.
Chapter Notes
739