JAVA Progrram

Problem 1 Let A and B two arrays of n elements, each. Given a number K, give an O(nlogn) time algorithm for determining whether there exists a A and b B suck that a + b = K. Hints: Use Heapsort(A, n) Take Advantage of BinarySearch()

Problem-2 Among Quicksort, Selection sort, Insertion sort and Heap sorts which one needs the minimum number of swaps? Hints: Go over the class lecture for individual sorting and simulate with an array Java Program