JAva

Problem-3 There are two sorted arrays A and B. First one is of size m + ncontaining m elements and another one is of size n and containing nelements. Merge these two arrays into the first array of size m + n such that the output is sorted. Hints: Trick is to start filling the destination array from the back with the largest elements.

Problem-4 Given an array A of n elements. Find three elements i, j and k in the array such that A[i]2 + A[j]2 = A[k]2. Hints: Use Heapsort(A, n) For each array index i compute A[i]2 and store in array Search for two numbers in array from 0 to i-1 which adds to A[i]. Java Program