Java program please Write a static method that accepts an array of integers as a parameterand performs a scan though the array to find the range of the numbersin the array. This means that it should find the largest and thesmallest numbers in the array, and then return the distance betweenthese two as a positive number.For example the range of:{1,2,3,4,5,6,7,8} is 7 because (8 - 1) = 7{12,15,17,19,2,4,7,20,10,5} is 18 because (20 - 2) = 18{30,20,20,30,1} is 29 because (30 - 1) = 29{6} is 0 because (6 - 6) = 0;%3D%DYou may assume that the array contains at least one element (itslength is at least 1). Do not make assumptions about the values of theelements in the array; they could be very large or small, etc. Do notchange or rearrange the values in the array.

Actually, array is a collection of elements.

Write a static method that accepts an array of integers as a parameter and performs a scan though the array to find the range of the numbers in the array. This means that it should find the largest and the smallest numbers in the array, and then return the distance between these two as a positive number. For example the range of: {1,2,3,4,5,6,7,8} is 7 because (8 – 1) = 7 %3D

Write a static method that accepts an array of integers as a parameter and performs a scan though the array to find the range of the numbers in the array. This means that it should find the largest and the smallest numbers in the array, and then return the distance between these two as a positive number. For example the range of: {1,2,3,4,5,6,7,8} is 7 because (8 – 1) = 7 %3D

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a program that stores a phrase as an array of words, and then prints it backward. The main method calls method getInput , which asks the user how many words there are, stores them in an array, and returns this array. printBackwards then take this array of words and prints it in reverse. For example, if the words were "Today" "is" "Monday" your method will print "Monday is Today"
Write a method called kthLargest() that accepts an integer x and an array a of integers as its parameters. It should then return the elements that that k elements of greater or equal value. So if k = 0 return the largest element. If k = 1. return the second-largest element, and so on. Do not change the array itself, but you can make a copy if you want. Suggested approach make a COPY of the array. Sort the copy then find the kth element of the copy and return it. The original is left untouched! :) For example if array1 = {74, 85, 102, 99, 101, 56, 84} and the function kthLargest(2, array1) is called, then your method should return 99 because there are two values that are larger than 99. (101 and 102). If x is less than zero or greater than/equal to the the size of the array then return -9999; Make sure your main function works for the following public static void main(String[] args){int[] array1 = {6, 8, 2, 3, 5, 12, 16, 1, 7, 4, 21, 19};int answer =…
Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. import java.util.Scanner; public class ModifyArray { /* Your solution goes here */ public static void main (String [] args) { Scanner scnr = new Scanner(System.in); int numElem = 4; int[] sortArray = new int[numElem]; int i; int userNum; for (i = 0; i < sortArray.length; ++i) { sortArray[i] = scnr.nextInt();} swapArrayEnds(sortArray); for (i = 0; i < sortArray.length; ++i) { System.out.print(sortArray[i]); System.out.print(" ");} System.out.println("");}}
Write a method called stdev that returns the standard deviation of an array of integers. Standard deviation is computed by taking the square root of the sum of the squares of the differences between each element and the mean, divided by one less than the number of elements. (It's just that simple!) More concisely and mathematically, the standard deviation of an array a is written as follows: stdev(a)=∑i=0a.length−1(a[ i ]−average(a)2)a.length−1 For example, if the array passed contains the values [1, –2, 4, –4, 9, –6, 16, –8, 25, –10], your method should return approximately 11.237.
Write a program with a main() method that asks the user to input an integer array of 10 elements.Next, create three methods described below. From inside your main() method, call each of thethree methods described below and print out the results of the methods 2, 3, which return values. 1. printReverse() - a method that receives an array of integers, then reverses the elements ofthe array and prints out all the elements from inside the method. Print all in one lineseparated by commas (see sample output below). Do not print the ‘trailing’ comma!!2. getLargest() – a method that receives an array of integers, then returns the largest integervalue in the array. Return largest integer and print from main(), not method.3. computeTwice()- a method that receives the previously reversed array of integers, thenreturns an array of integers which doubles the value of each number in the array (see thesample output below). Return new array of integers print from main(), not methodEXAMPLE OUTPUT:Enter…
Write a method that takes two arrays of integers and combines the two arrays into one array with only unique integers. In other words, combine two arrays but don't include repeats of any numbers. For example, if you have {1, 2, 3, 4, 5} and {3, 4, 5, 6, 7}, when you combine these, the result should be {1, 2, 3, 4, 5, 6, 7}. (Note that you don't have to put them in order, but that might help you when writing your algorithm) (in java)
Write a method that takes two arrays of integers and combines the two arrays into one array with only unique integers. In other words, combine two arrays but don't include repeats of any numbers. For example, if you have {1, 2, 3, 4, 5} and {3, 4, 5, 6, 7}, when you combine these, the result should be {1, 2, 3, 4, 5, 6, 7}. (Note that you don't have to put them in order, but that might help you when writing your algorithm)
Write a method called largestRow that take a two-dimension array of integers as a parameter and returns the number of the row that has the largest length. For example, if the array (as created by the program below) is 10 45 3 8 2 42 3 21 44 The value returned would be zero (row zero has the largest length).
Write a static method named "bigBeforeSmall" that accepts an array of Strings as a parameter and rearranges its elements so that longer Strings appear before shorter Strings. For example, if the following array is passed to your method: String[] numbers = { "one", "twelve", "three", "four", "fourteen", "six" }; Then after the method has been called, one acceptable ordering of the elements would be: ["fourteen", "twelve", "three", "four", "one", "six" ] The exact order of the elements does not matter, so long as all longer Strings appear before all shorter Strings. Another acceptable order would be: ["fourteen", "twelve", "three", "four", "six", "one" ] Do not make any assumptions about the length of the array or the range of values it might contain. For example, the array might contain empty Strings (length zero), or all Strings could have the same length. You may assume that the array is not null (empty). Hint: This is actually a sorting problem. In BubbleSort you tested pairs…
Write a test program that creates two hexagons (5) and (10) and compares them using method compareTo(). Also, create array of four comparable hexagons with side value (4), (6), (10) and (2). Pass the array as parameter to method max. You should get the following result. Comparing two Hexagons -1 Max hexagon with biggest number of sides is 10.0
FOR JAVA Write a method that takes a one dimensional integer array, an integer (as index) and another integer (as number). Your program must insert the number into the given index, shift the rest of the elements to the right, and return the new array. For instance, if we want to insert the number 0 into position 3 of {1, 2, 3, 4, 5}, your method must return {1, 2, 3, 0, 4, 5}.
Write a method that accepts an array of integers as a parameter and returns a reference to an array that contains the even numbers in the original array. The returned array should have a size equal to the number of even numbers in the original array. Use Java language.