These problems will help you understand the sorting. This Homework should prepare you for Project 3
Problem 1. (IndirectSort.java) Implement the static method sort() in IndirectSort.java that indirectly sorts a[] using insertion sort, ie, not by rearranging a[], but by returning an array perm[] such that perm[i] is the index of the ith smallest entry in a[].
$ java IndirectSort
INDIRECTINSERTIONSORTEXAMPLE <ctrl -d>
ACDEEEEIIIILMNNNOOPRRRSSTTTX
Problem 2. (MergeQueues.java) Implement the static method merge() in that takes two queues of sorted items as arguments and returns a queue that results from merging the queues into sorted order. Your implementation must be linear and must not alter the input queues.
$ java MergeQueues
ABCDEFGHIJKLMNOPQRSTUVWXYZ
Problem 3. (CertifyHeap.java) Implement the static method maxOrderedHeap() in CertifyHeap.java that takes an array a[] of Comparable objects and returns true if a[] represents a maximum-ordered heap and false otherwise. Your implementation must be linear.
$ java CertifyHeap
0THRPSOAEING
<ctrl -d>
false
$ java CertifyHeap
0TSRPNOAEIHG
<ctrl -d>
true
CS146 Homework 3
Problem 4. (Ramanujan.java) Srinivasa Ramanujan was an Indian mathematician who became famous for his intuition for numbers. When the English mathematician G. H. Hardy came to visit him one day, Hardy remarked that the number of his taxi was 1729, a rather dull number. To which Ramanujan replied, \No, Hardy! It is a very interesting number. It is the smallest number expressible as the sum of two cubes in two different ways." Verify this claim by writing a program Ramanujan.java that takes a command-line argument N and prints out all integers less than or
$ java Ramanujan 40000
1729 = 1^3 + 12^3 = 9^3 + 10^3
4104 = 2^3 + 16^3 = 9^3 + 15^3
13832 = 18^3 + 20^3 = 2^3 + 24^3
20683 = 19^3 + 24^3 = 10^3 + 27^3
32832 = 18^3 + 30^3 = 4^3 + 32^3
39312 = 15^3 + 33^3 = 2^3 + 34^3
equal to N that can be expressed as the sum of two cubes in two different ways. In other words, find distinct positive integers i, j, k, and l such that i3 + j3 = k3 + l3. A much more sophisticated implementation of the same program is using a minimum-oriented priority queue. Initialize a minimum-oriented priority queue with pairs (1, 2), (2, 3), (3, 4), …, (i, i + 1) such that i < 3√ . Then, while the priority queue is nonempty, remove the pair (i, j) such that i3 +j3 is the smallest (this is easily done since we are using a minimum-oriented priority queue), print the previous pair (k, l) and current pair (i, j) if k3 + l3 = i3 + j3 <= N, and then if j < 3√ insert the pair (i, j + 1) into the queue.
Submitting Information:
• DO NOT post your code on Piazza
• Use the code I provided for each problem. DO NOT delete any function
• Submit your work on Canvas.
• DO NOT change the name of .java files.
• Put all the .java files in one zip file and name it <last><first>.zip
• The deadline is Friday, Nov 2nd at 6:PM
• Follow the guidelines in homework rubric 3
