Create a programme called CubeSum.java that efficiently prints out all integers of the form a3 + b3 where a and b are integers between 0 and N. This means that you should only compute and print the necessary integers rather than computing an array of size N3 and sorting it.

Given two sorted arrays, your task is to merge them in a new sorted array. Write a complete program in Java that takes two stored arrays of integers, and then calls a method that merges the two sorted arrays into one array that is sorted. The method returns a new array made by merging the two input sorted arrays. Note that the input arrays can be of different sizes. Assume that the size of each input array is given. You can NOT write a sorting algorithm or apply sorting. To clarify: You cannot merge the two arrays into one and then just sort it using a sorting algorithm. Examples: Input : arr1 = { 1, 3, 4, 5} arr2 = {2, 4, 6, 8} Output : arr3 = {1, 2, 3, 4, 5, 6, 7, 8} Input : arr1 = { 5, 8, 9} arr2 = {4, 7} Output : arr3 = {4, 5, 7, 8, 9}

Write a java program that prompts user for 10 numbers of any type and stores them in an array. Then print the following: All the values in the array. The sum of all values in the array. The average of all values in the array. The largest value in the array. The smallest value in the array. All the positive numbers in array. All the negative numbers in array. All the odd numbers in array. All the even numbers in array.

Can you do it in Java

Write a Java program with a single-dimension array that holds 10 integer numbers and identify the maximum value of the 10 numbers. Next sort the array using a bubble sort and display the array before and after sorting. Psuedocode Generate 10 random integer numbers between 1 and 100 place each random number in a different element of a single-dimension array Display the array's contents unsorted as they are generated Using the bubble sort, sort the array from smallest integer to the largest. //must use the following:    Bubble Sort Code:          public static void bubbleSort(int[] list)          {            int temp;                                               for (int i = list.length - 1; i > 0; i--)              {                 for (int j = 0; j < i; j++)                 {                   if (list[j] > list[j + 1])                   {                   temp = list[j];                   list[j] = list[j + 1];                   list[j + 1] = temp;                   }…

Write the following Java program Allocate an array a of ten integers. Put the number 17 as the initial element of the array. Put the number 29 as the last element of the array. Fill the remaining elements with –1. Add 1 to each element of the array. Print all elements of the array, one per line. Print all elements of the array in a single line, separated by commas.