Problem
1. Experimentally compare the performance of in-place quick-sort and a version of quick-sort that is not in-place.
2. 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.