Question

In: Computer Science

Given an array of integers, implement (in Java) the moveAllNegativeOne method to move all -1 present...

Given an array of integers, implement (in Java) the moveAllNegativeOne method to

move all -1 present in the array to the end. The algorithm should maintain the relative

order of items in the array and worst-case running time complexity must be linear.

Example:

Input: [6, -1, 8, 2, 3, -1, 4, -1, 1]

Output: [6, 8, 2, 3, 4, 1, -1, -1, -1]

Important Notes:

• You must add the main method in your program in Java in order to test your

implementation.

• You can use the array of the previous example to test your program, however, I

suggest that you also use other input arrays to validate the correctness and

efficiency of your solution.

• Your program MUST be submitted only in source code form (.java file).

• A program that does not compile or does not run loses all correctness points.

Comment on all functions purposes

Expert Solution

public class Main {

public static void moveAllNegativeOne(int arr[]) {

int nonMinusOnes = 0;

for (int i = 0; i < arr.length; i++)

if (arr[i] != -1)

arr[nonMinusOnes++] = arr[i];

while (nonMinusOnes < arr.length)

arr[nonMinusOnes++] = -1;

}

public static void main(String[] args) {

int arr[] = new int[]{6, -1, 8, 2, 3, -1, 4, -1, 1};

moveAllNegativeOne(arr);

for (int i = 0; i < arr.length; i++)

System.out.print(arr[i] + " " );

}

====================================
SEE OUTPUT

========================================
Thanks, let me now if there is any concern.

venereology answered 1 hour ago

use java for : 1. Write a method called indexOfMax that takes an array of integers...

use java for : 1. Write a method called indexOfMax that takes an array of integers and returns the index of the largest element. 2. The Sieve of Eratosthenes is “a simple, ancient algorithm for finding all prime numbers up to any given limit” (https://en.wikipedia. org/wiki/Sieve_of_Eratosthenes).Write a method called sieve that takes an integer parameter, n, and returns a boolean array that indicates, for each number from 0 to n -1, whether the number is prime.

1. Implement a public method named initialize. It takes a twodimensional square array of integers...

1. Implement a public method named initialize. It takes a two dimensional square array of integers namedarray as a parameter. It initializes all of the elements of the array to the sum of their indices except for themajor diagonal (upper left to lower right) where each element is initialized to -1. (For testing use a 4X4 or5X5 array and have the application print out the array in 2 dimension format.2. Implement a method named totals that takes a two dimensional...

Problem 1: Unsorted arrays Given an array of integers that is unsorted, implement the following functions:...

Problem 1: Unsorted arrays Given an array of integers that is unsorted, implement the following functions: • myAdd ( ): add an integer d to the array; return 0 if the operation is successful; return a negative number otherwise. • search ( ): given an integer d, if d is found in the array, return the index of the cell containing d. Return a negative number otherwise (e.g., d is not found in the array). • myRemove ( ): Step...

IN JAVA PLEASE Given an unsorted array numbers of integers with duplicate values. Sort the array...

IN JAVA PLEASE Given an unsorted array numbers of integers with duplicate values. Sort the array and remove the duplicates in-place such that each element appears only once in the input array and returns the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. Find the time complexity of your removeDuplicates() method in Big-O notation and write that in a comment line on the top...

java Given a sequence of integers as an array, determine whether it is possible to obtain...

java Given a sequence of integers as an array, determine whether it is possible to obtain a strictly increasing sequence by removing no more than one element from the array. Here are the constraints. 1. You must use only arrays. 2. You are not allowed to make copies of the array (use only the one that is passed). 3. Your algorithm running time must be at most O(n 2 ). i.e. You can have only one loop within another. Ideally,...

Given an array A[1..n] of integers - all of whose numbers are in the range [0,...

Given an array A[1..n] of integers - all of whose numbers are in the range [0, n^3 − 1] give an algorithm which sorts them in O(n) time.

FOR JAVA Write a method called findNum that takes a two-dimension array of integers and an...

FOR JAVA Write a method called findNum that takes a two-dimension array of integers and an int as parameters and returns the number of times the integer parameter appears in the array. For example, if the array (as created by the program below) is 10 45 3 8 2 42 3 21 44 And the integer parameter is 3, the value returned would be 2 (the number 3 appears two times in the array) public class HomeworkA { public static...

IN JAVA Methods**: Sort three values Write a method Ascend3 with an array of integers of...

IN JAVA Methods**: Sort three values Write a method Ascend3 with an array of integers of size three as the parameter, that sorts the values of the array into ascending order. Ex: If the array contains [5, 2, 7], after the call Ascend3(int[] vals), the array will now hold [2, 5, 7]. Hints: Return type should be void. One approach puts the three values into an array, then sorts the array. We won't be describing that approach here. Instead, we'll...

***JAVA PROGRAM Write a method called shrink that accepts an array of integers (that the user...

***JAVA PROGRAM Write a method called shrink that accepts an array of integers (that the user inputs) as a parameter and returns a new array containing the result of replacing each pair of integers with the sum of that pair. For example, if an array called list stores the values {7, 2, 8, 9, 4, 15, 7, 1, 9, 10}, then the call of shrink(list) should return a new array containing {9, 17, 19, 8, 19}. The first pair from...

Problem Definition: Problem: Given an array of integers print all pairs of integers a and b...

Problem Definition: Problem: Given an array of integers print all pairs of integers a and b where a + b is equal to a given number. For example, consider the following array and suppose we want to find all pairs of integers a and b where a + b = 16 A= [ 10, 4, 6, 15, 3, 5, 1, 13] The following are pairs that sum to 16: 13, 3 6, 10 15, 1 Your program should print these...