how to write in java; Write a method int[] coPrime[int num, int[]numbers] { // instructions are...

how to write in java;

Write a method int[] coPrime[int num, int[]numbers]

{

// instructions are that it returns an array of all the elements of the int[] array numbers which are coprime with x

}

Note that the array that is returned may be an empty array--you will have to count how many times gcf(x, numbers[i]) == 1. ASSUME numbers is not null and not empty.

Expert Solution

venereology answered 1 year ago

How to inhabit the int array num with random numbers using a function that you then...

How to inhabit the int array num with random numbers using a function that you then invoke from the main method. I already created a function that generates an array of 5 random integers. /* int i; int arrayName[5]; for(i= 0;i < 6; i++ ){ //type arrayName[arraysize]; arrayName[i] = rand()% 200; printf("array[%d] = %d\n",i,arrayName[i]); */ // use rand() % some_number to generate a random number int num[5]; int main(int argc, char **argv) { // hint // function invocation goes here...

Write Java program Lab43.java which declares and initializes numeric array of 5 elements (int num[5]) and...

Write Java program Lab43.java which declares and initializes numeric array of 5 elements (int num[5]) and produces as output the sum of integers in an array, the largest and the smallest element in an array. Your program should contain the following methods: public static int sum(int[]) public static int findLargest(int[]) public static int findSmallest(int[])

（java）Write a recursive method public static int sumForEachOther(Int n) that takes a positive Int as an...

（java）Write a recursive method public static int sumForEachOther(Int n) that takes a positive Int as an argument and returns the sum for every other Int from n down to 1. For example, sumForEachOther(8) should return 20, since 8+6+4+ 2=20.And the call sumForEachOther(9) should return 25 since 9+7+5 + 3+1-=25. Your method must use recursion.

Write a java method that takes a string and returns an array of int that contains...

Write a java method that takes a string and returns an array of int that contains the corresponding alphabetic order of each letter in the received string: An illustration: the method takes: "Sara" the method returns: {4,1,3,2} another illustration: the method takes: "hey" the method returns: {2,1,3}

Q1: Given the following code, what is returned by tq(4)? int tq(int num){ if (num ==...

Q1: Given the following code, what is returned by tq(4)? int tq(int num){ if (num == 0) return 0; else if (num > 100) return -1; else return num + tq( num – 1 ); } Group of answer choices: 0 4 -1 10 Q2: Given that values is of type LLNode<Integer> and references a linked list (non-empty) of Integer objects, what does the following code do if invoked as mystery(values)? int mystery(LLNode<Integer> list) { if (list.getLink() ==...

Just that method --> Java code Write a method “int sumPos(List aList)” to calculate the sum...

Just that method --> Java code Write a method “int sumPos(List aList)” to calculate the sum of positive integers in an ADT List aList of integers using ADT List operations. ADT List operations: isEmpty(), size(), add(index, item), remove(index), get(index), and removeAll(). You should not assume how an ADT List is implemented. Using array indexing, head/tail references, or any operation not defined in ADT List is not allowed.

Code with Java and no imports, Method sandwiched returns true if num is in the element...

Code with Java and no imports, Method sandwiched returns true if num is in the element before and after an element that is not equal to num sandwiched([4,5,4,6,7,3], 4) returns true sandwiched([2,1,2], 2) returns true sandwiched([3,3,3], 3) returns false sandwiched([4,5,6,4], 4) returns false sandwiched([1,1,2,3,1,4,1], 1) returns true @param nums Integer ArrayList @param num integer @return true if a single number is between elements equal to num */ public static boolean sandwiched(ArrayList nums, int num) { return false; }//end sandwiched

JAVA please write this method public static void recursiveSelectionSort(int[] arr) { }

JAVA please write this method public static void recursiveMergeSort(int[] arr) { }

How is this method coded in java? int differential(int[] post) differential computes the virtual differential for...

How is this method coded in java? int differential(int[] post) differential computes the virtual differential for a single post record and returns the differential. The differential is simply the difference between ups and downs. differential is virtual because it is not stored in a post record. /// Compute the differential between "ups" (at index 1) and "downs" /// (at index 2). The differential is not maintained in the data but is a /// virtual field derived by the calculation performed...

Question