subject

Merge together two sorted arrays of ints into a new array. * * Example1 merge: [-1 3 5 7 ] with [ 2 4 6 8] would yield [-1 2 3 4 5 6 7 8] * Example2 merge: [1 6 ] with [ 2 3 8 9] would yield [1 2 3 6 8 9]
* There is no guarantee about the size of either array. When/if you run out of elements in * either array, copy all the remaining elements from the non-empty array to the new array
* preconditions:
* both arrays, are sorted low to high
* there are no duplicate values among the two arrays
* either array may be empty
* postcondition: return an array with all elements from both arrays sorted from low to high
*
* You may not use any additional methods, sorting routines, etc
* For full credit, your solution may only go through each array one time ( so in particular - no nested loops)
*
* You will need to create a new array inside the function
* You do not have to write this recursively.
public static int[] mergeArrays( int[] a, int[] b) {

int[] answer = new int[0]; // an empty array to have something to return
return answer; // ToDo 3 . Fix this.
}

/*
* exercising functions and main.
* There are no Todo's for you in the code below.
*/
public static void mergeArrayTests() {

int a[] = new int[] {1,3,5,7,9,11};
int b[] = new int[] {2,4,6};
int[] combinedArray = mergeArrays( a, b);
StdOut. println("merging: "+ Arrays. toString(a) + " " + Arrays. toString(b));
StdOut. println(" --> " + Arrays. toString(combinedArray));

int c[] = new int[] {1,3,5,7,9,11};
int d[] = new int[] {2,4};
combinedArray = mergeArrays( c, d);
StdOut. println("merging: "+ Arrays. toString(c) + " " + Arrays. toString(d));
StdOut. println(" --> " + Arrays. toString(combinedArray));

int e[] = new int[] {1,3,5,7,9,11};
int f[] = new int[] {};
combinedArray = mergeArrays( e, f);
StdOut. println("merging: "+ Arrays. toString(e) + " " + Arrays. toString(f));
StdOut. println(" --> " + Arrays. toString(combinedArray));

int g[] = new int[] {3,11};
int h[] = new int[] {2,4,6,8,10};
combinedArray = mergeArrays( g, h);
StdOut. println("merging: "+ Arrays. toString(g) + " " + Arrays. toString(h));
StdOut. println(" --> " + Arrays. toString(combinedArray));
}

public static void main (String[] args) {

StdOut. println(" This main function calls your functions for a variety of inputs");
StdOut. println(" and simply prints the results");
StdOut. println(" It does NOT check to see if your functions return the correct values");
StdOut. println(" It is up to you to review the output and verify the results");
StdOut. println("");
int[] list0 = new int[] {};
int[] list1 = new int[] { 5 };
int[] list2 = new int[] { 3, 4 };
int[] list3 = new int[] { -2, 3, -4 };
int[] list4 = new int[] { -1, -2, -4, -5 };
int[] list5 = new int[] { 6, 1, 2, -3, 8 };

StdOut. format(" list: %s sum of positives: %d\n",Arrays. toString(list0), sumOfPositivesRecursive (list0));
StdOut. format(" list: %s sum of positives: %d\n",Arrays. toString(list1), sumOfPositivesRecursive (list1));
StdOut. format(" list: %s sum of positives: %d\n",Arrays. toString(list2), sumOfPositivesRecursive (list2));
StdOut. format(" list: %s sum of positives: %d\n",Arrays. toString(list3), sumOfPositivesRecursive (list3));
StdOut. format(" list: %s sum of positives: %d\n",Arrays. toString(list4), sumOfPositivesRecursive (list4));
StdOut. format(" list: %s sum of positives: %d\n",Arrays. toString(list5), sumOfPositivesRecursive (list5));
StdOut. println();

StdOut. println ("Reverse: Before: " + Arrays. toString(list1 ) );
reverseArray (list1);
StdOut. println (" After: " + Arrays. toString (list1) + "\n" );

StdOut. println ("Reverse: Before: " + Arrays. toString(list2 ) );
reverseArray (list2);
StdOut. println (" After: " + Arrays. toString (list2) + "\n");

StdOut. println ("Reverse: Before: " + Arrays. toString(list3 ) );
reverseArray (list3);
StdOut. println (" After: " + Arrays. toString (list3) + "\n");

StdOut. println ("Reverse: Before: " + Arrays. toString(list4 ) );
reverseArray (list4);
StdOut. println (" After: " + Arrays. toString (list4) + "\n");

StdOut. println ("Reverse: Before: " + Arrays. toString(list5 ) );
reverseArray (list5);
StdOut. println (" After: " + Arrays. toString (list5) + "\n");

mergeArrayTests();
StdOut. println("");
StdOut. println(" Output was not verified to be correct by this program. ");
StdOut. println(" It is up to you to review the output and verify the results");

}
}

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 07:30
By refraining from constructing a building until they are certain that it will not cause harm to the environment, an organization is adhering to the
Answers: 2
question
Computers and Technology, 22.06.2019 18:00
Suppose an astronomer discovers a large, spherical-shaped body orbiting the sun. the body is composed mostly of rock, and there are no other bodies sharing its orbit. what is the best way to categorize this body? a. planet b. moon c. comet d. asteroid
Answers: 1
question
Computers and Technology, 24.06.2019 07:00
Guys do you know sh27 cause he hacked me : ( pidgegunderson my old user
Answers: 2
question
Computers and Technology, 24.06.2019 20:30
Which key should you press to leave the cell as it originally was? a. delete b. cancel c. backspace d. enter
Answers: 1
You know the right answer?
Merge together two sorted arrays of ints into a new array. * * Example1 merge: [-1 3 5 7 ] with [ 2...
Questions