Advertisement
Guest User

Untitled

a guest
Dec 3rd, 2019
228
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.81 KB | None | 0 0
  1. In this assignment, you will write a program which merges two arrays of positive integers and removes any duplicate entries.
  2.  
  3. Your program will first ask for a valid length which must be an integer which is 10 or greater. The program should continue to ask until a valid length is entered. The program will then create two arrays of the length entered, fill these with random integers between 1 and 100 inclusive, and print both of these arrays. Finally, the program will create and print an array using all the elements which are in the two arrays but not including any duplicates. The merged array may have space for more elements than needed: extra elements at the end of the array should be set to 0 and not printed by the program.
  4.  
  5. The numbers should be added to the merged array in an alternating pattern: first from list 1, then from list 2, then list 1 again, etc. If a number in one of the arrays already appears in the merged array, then it should be ignored, and the program should alternate to the other list again. For example, if the first list begins 1 2 3 10, and the second begins 3 4 5 8, then the merged list would begin 1 3 2 4 5 10 8.
  6.  
  7. Because the number of elements in the merged array is unknown, its size should be set to the maximum possible number of elements it should contain, and after all elements which should form the merged array appear, any remaining unfilled spaces in the array should be 0. The first 0 encountered in the array should signal the end of the “actual” elements of the array, and therefore the 0s at the end of the array should not be printed by your program.
  8.  
  9. Be sure that your output is in the format shown in the sample run, with one array on each line and each one named correctly: the Code Runner needs to be able to read the arrays that are printed in order to correctly grade your work.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement