Question: (5 points) Consider the array C after the first two loops of counting sort on some integer array A. Assume a and b are integers
-
(5 points) Consider the array C after the first two loops of counting sort on some integer array A. Assume a and b are integers and a < b. What information of A can we not compute using C?
-
(5 points) In bucket sort, we create n buckets (where n is the length of the input array). What would happen if we used a number of buckets much less than n?
-
(5 points) The worst case of bucket sort is O(n2). What can we do to make the worst case O(n lg n)?
-
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
