import math array = [4, 5, 6, 7, 8, 9, 33, 24, 15, 11] print("Original array") print(array) print() # Get no. of elements n = len(array) s = math.floor((n-1)/2) e = math.floor(n/2) # while loop while (s >= 0 and e <= n-1): # swap the numbers array[s], array[e] = array[e], array[s] s = s-1 e = e+1 # now array is reversed print("Reversed array") print(array) Check this code and ,using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size.

import math array = [4, 5, 6, 7, 8, 9, 33, 24, 15, 11] print("Original array") print(array) print() # Get no. of elements n = len(array) s = math.floor((n-1)/2) e = math.floor(n/2) # while loop while (s >= 0 and e <= n-1): # swap the numbers array[s], array[e] = array[e], array[s] s = s-1 e = e+1 # now array is reversed print("Reversed array") print(array) Check this code and ,using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

Write program java Create 2D array 4 *5. Ask the user to enter the number inside the array. Print the numbers organized by rows. Calculate the average for each row. Print the least average. Finally, create a method that receives a 2D array to print its elements reverse starting from the last element.
in java Integer numElements is read from input, representing the number of integers to be read next. Then, the remaining integers are read and stored into array valuesArray. For each element in valuesArray that is divisible by 9, assign the element with the element's current value plus 1. Ex: If the input is: 3 81 99 30 then the output is: Original values: 81 99 30 New values: 82 100 30 Note: (x % 9 == 0) returns true if x is divisible by 9. 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 for (i=0; i<valuesArray.length; ++i) { valuesArray[i] =scnr.nextInt(); } System.out.print("Original values: "); for (i=0; i<valuesArray.length; ++i) { System.out.print(valuesArray[i] +" "); } System.out.println(); /* Your code goes here */ System.out.print("New values: "); for (i=0; i<valuesArray.length; ++i) { System.out.print(valuesArray[i] +" "); } System.out.println(); } }
in java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.
Write the following java code: Declare an array of int int myArray [] = { 4, 3, 2, 4, 8, 7, 5, 6, 2, 4, 7, 9, 5, 3, 7, 1}; Using an enhanced for loop, print how many elements are greater than 5(count).
Given an array of numbers, and an integer, find the last index that that integer appears in the array. If the number is not found, return -1. import java.util.ArrayList;public class LastIndexFound{public static int solution(ArrayList<Integer> nums, int numToFind){// ↓↓↓↓ your code goes here ↓↓↓↓return 0;}}
Write a program to ask the user for the number of arrays he wants to maintain and then populate eacharray by taking elements from the user. Merge all these arrays in another array and finally remove duplicateelements from the merged array.
I need help with creating a Java program described below: Minesweeper.Write a program that reads three numbers, m, n, and p and produces an m-by-n Booleanarray where each element is occupied with probability p. In the minesweeper game, occupiedcells represent bombs and empty cells represent safe cells.Print out the array using an asterisk for bombs and a period for safe cells.Then, create an integer two-dimensional array with the number of neighboring bombs (above,below, left, right, or diagonal). * * . . . * * 1 0 0. . . . . 3 3 2 0 0 . * . . . 1 * 1 0 0Write your code so that you have as few special cases as possible to deal with, by using an(m+2)-by-(n+2) Boolean array.
FOR JAVA Write a method that takes a two dimensional integer array, and returns the number of elements in it. Note that your method should also work with nonrectangular arrays such as {{1}, {2, 3}, {4, 5, 6}}.
Q2. Write a Java program named RandomNumbers that creates a single-dimensional array of int of size 20 and initialize its elements with 20 random integer numbers (their range must be between 1 and 100 inclusive. Write statements in your program to display the array elements, and how many odd and even numbers are there in the array. For example, if the random numbers were stored in the array are: 83 48 89 66 40 94 31 31 12 45 45 87 10 24 78 2 28 31 52 46 Then the program should display: The random numbers are: 83 48 89 66 40 94 31 31 12 45 45 87 10 24 78 2 28 31 52 46 There are 8 odd numbers There are 12 even numbers An element in the array is a peak (max or min) if the elements before and after that element are greater than the element itself (min) or the elements before and after that element are less than the element (max). Write a method in your program called displayPeaks…
For an array declartion of int number [25];, what will be the ending index? 0 1 24 25
# the method take another circular array and returns a linear array containing the common elements between the two circular arrays. def intersection(self, c2): # To Do print("==========Test 10==========") lin_arr9 = [10, 20, 30, 40, 50, None, None, None] c10 = CircularArray(lin_arr9, 5, 5) c10.printFullLinear() # This should print: 40, 50, None, None, None, 10, 20, 30 lin_arr10 = [5, 40, 15, 25, 10, 20, 5, None, None, None, None, None] c11 = CircularArray(lin_arr10, 8, 7) c11.printFullLinear() # This should print: 10, 20, 5, None, None, None, None, None, 5, 40, 15, 25 output = c10.intersection(c11) print(output) # This should print: [10, 20, 40]
Write the method sum2D() which accepts a two dimensional integer array and returns the sum of all the elements of the array.