Program plan: MergeArrayLists.java Create a class named “MergeArrayLists”. Create a function named “merge()” to merge the two array lists. Declare and initialize “i” and “j” equal to “0”. Declare an integer array list named “c”. Using the “While” loop, merges the two array list “a” and “b” and store the result into an array list “c”. Using the “add()” method, add the elements stored in the array list “a” into the array list “c”. Using the “add()” method, add the elements stored in the array list “b” into the array list “c”. Increment the variables “i” and “j” by one. Using the “While” loop, store the last element of array list “a” into the array list “c”. Using the “add()” method, add the elements stored in the array list “a” into the array list “c” and increment the “i” by one. Using the “While” loop, store the last element of array list “b” into the array list “c”. Using the “add()” method, add the elements stored in the array list “b” into the array list “c” and increment the “j” by one. Return the result “c”. Create a main function. Declare and initialize the array lists “a” and “b” to some values. Declare a variable “MAX” to store the maximum value. Using the “for” loop, generate the random values between “0” and “8”. Using the “add” method, add the generated random value into the array list “a”. Using the “if” conditional statement, check whether “i” modulus of “2” is zero or not. Using the “add” method, add the generated random value into the array list “b”. Make a call to the function “merge()”, by passing two array lists “a” and “b” and store the merged array list into the array list named “c”. Print and display the merged array list on the console.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 20PE

Program Plan Intro

Program plan:

MergeArrayLists.java

Create a class named “MergeArrayLists”.

Create a function named “merge()” to merge the two array lists.

Declare and initialize “i” and “j” equal to “0”.

Declare an integer array list named “c”.

Using the “While” loop, merges the two array list “a” and “b” and store the result into an array list “c”.

Using the “add()” method, add the elements stored in the array list “a” into the array list “c”.

Using the “add()” method, add the elements stored in the array list “b” into the array list “c”.

Increment the variables “i” and “j” by one.

Using the “While” loop, store the last element of array list “a” into the array list “c”.

Using the “add()” method, add the elements stored in the array list “a” into the array list “c” and increment the “i” by one.

Using the “While” loop, store the last element of array list “b” into the array list “c”.

Using the “add()” method, add the elements stored in the array list “b” into the array list “c” and increment the “j” by one.

Return the result “c”.

Create a main function.

Declare and initialize the array lists “a” and “b” to some values.

Declare a variable “MAX” to store the maximum value.

Using the “for” loop, generate the random values between “0” and “8”.

Using the “add” method, add the generated random value into the array list “a”.

Using the “if” conditional statement, check whether “i” modulus of “2” is zero or not.

Using the “add” method, add the generated random value into the array list “b”.

Make a call to the function “merge()”, by passing two array lists “a” and “b” and store the merged array list into the array list named “c”.

Print and display the merged array list on the console.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Using the notation

you can select multipy options

For each of the following, decide whether the claim is True or False and select the True ones: Suppose we discover that the 3SAT can be solved in worst-case cubic time. Then it would mean that all problems in NP can also be solved in cubic time. If a problem can be solved using Dynamic Programming, then it is not NP-complete. Suppose X and Y are two NP-complete problems. Then, there must be a polynomial-time reduction from X to Y and also one from Y to X.