Write an algorithm to merge two arrays X[6], Y[5] stored in descending

1.	Write an algorithm to merge two arrays X[6], Y[5] stored in descending order. The resultant array should be in ascending order.
Answer» Assuming that L=0 and U=6-1,5-1 and (6+5)-1 respectively for X, Y, and Z 1. ctrX=6-1; ctrY=5-1; ctrZ=0; 2. while ctrX>=0 and ctrY>=0 perform steps 3 through 10 3. { If X[ctrX]<=Y[ctrY] then 4. { Z[ctrZ]=X[ctrX] 5. ctrZ=ctrZ+1 6. ctrX=ctrX-1 } 7. else 8. { Z[ctrZ]=Y[ctrY] 9. ctrZ=ctrZ+1 10. ctrY=ctrY-1 } } 11. if ctrX<0 then 12. { while ctrY>=0 perform steps 13 through 15 { 13. Z[ctrZ]=Y[ctrY] 14. ctrZ=ctrZ+1 15. ctrY=ctrY-1 } } 16. if ctrY<0 then 17. { while ctrX>=0 perform steps 18 through 20 18. { Z[ctrZ]=X[ctrX] 19. ctrZ=ctrZ+1 20. ctrX=ctrX-1 } }

Write an algorithm to merge two arrays X[6], Y[5] stored in descending order. The resultant array should be in ascending order.

Answer»

Assuming that L=0 and U=6-1,5-1 and (6+5)-1 respectively for X, Y, and Z

1. ctrX=6-1; ctrY=5-1; ctrZ=0;

2. while ctrX>=0 and ctrY>=0 perform steps 3 through 10

3. { If X[ctrX]<=Y[ctrY] then

4. { Z[ctrZ]=X[ctrX]

5. ctrZ=ctrZ+1

6. ctrX=ctrX-1 }

7. else

8. { Z[ctrZ]=Y[ctrY]

9. ctrZ=ctrZ+1

10. ctrY=ctrY-1 }

}

11. if ctrX<0 then

12. { while ctrY>=0 perform steps 13 through 15

{

13. Z[ctrZ]=Y[ctrY]

14. ctrZ=ctrZ+1

15. ctrY=ctrY-1

}

16. if ctrY<0 then

17. { while ctrX>=0 perform steps 18 through 20

18. { Z[ctrZ]=X[ctrX]

19. ctrZ=ctrZ+1

20. ctrX=ctrX-1

}

Discussion

No Comment Found

Related InterviewSolutions

An array Arr[35][15] is stored in the memory along the row with each element occupying 4 bytes. Find out the base address and address of an element Arr[20][5], if the location Arr[2][2] is stored at the address 3000.
An array Arr[15][35] is stored in the memory along the column with each element occupying 8 bytes. Find out the base address and address of the element Arr[2][5], if the location Arr[5][10] is stored at the address 4000.
What is the pre-condition for applying binary search algorithm?
Write an algorithm to search for 66 and 71 in the following array:3, 4, 7, 11, 18, 29, 45, 71, 87, 89, 93, 96, 99Make use of binary search technique. Also give the intermediate results while executing this algorithm. Convert this algorithm into a C++ program.
Suppose X, Y, Z are arrays of integers of size M, N and M+N respectively. The numbers in array X and Y appear in descending order.Write a user defined function in C++ to produce third array Z by merging arrays X and Y in descending order.
Suppose A, B, C are arrays of integers of size M, N and M+N respectively. The numbers in array A appear in ascending order while the numbers in array B appear in descending order. Write a user defined function in C++ to produce third array C by merging arrays A ad B in Ascending order. Use A, B, and C as arguments in the function.
Suppose A, B, C are arrays of integers of sizes m, n, m+n respectively. The numbers in arrays A and B appear in descending order. Give an algorithm to produce a third array C, containing all the data of array A and B in ascending order.
Given two arrays of integers X and Y of sizes m and n respectively. Write a function named MERGE() which will produce a third array named Z, such that the following sequence is followed:(i) All odd numbers of X from left to right are copied into Z from left to right(ii) All even numbers of X from left to right are copied into Z from right to left(iii) All odd numbers of Y from left to right are copied into Z from left to right(iv) All even numbers of Y from left to right are copied into Z from right to left X, Y and Z are passed as argument to MERGE().e.g., X is {3, 2, 1, 7, 6, 3} and Y is {9, 3, 5, 6, 2, 8, 10} the resultant array Z is {3, 1, 7, 3, 9, 3, 5, 10, 8, 2, 6, 6, 2}
Write an algorithm to merge two arrays X[6], Y[5] stored in descending order. The resultant array should be in ascending order.
Write an algorithm to add corresponding elements of two matrices A[3 x 3] and B[3 x 3]