What do I change to make it workJava {*/public void swapFirstAnd SecondHalf (int[] values){}This method swaps the first and second half of the given array.@param values an array}int[] first = new int [values.length/2];int[] second = new int [values.length/2];for (int i = 0; i < values. length / 2; i++) {second[i] = values[i];}for (int j = values. length / 2; j < values.length; j++) {first[j] = values [j];}for (int k = 0; k< values.length / 2; k++) {values[k] = first [k];}for(int 1 = values.length / 2; 1 < values.length; l++) {values [1] second [1];}// This method is used to check your workpublic int[] check(int[] values){swapFirstAndSecondHalf(values);return values; failNameArgumentscheck new int[] { 1, 2, 3, 4 }fail check new int[] { 1, 2, 3, 4, 5 }pass check new int[] { }ActualException in thread "main" java.lang. ArrayIndexOutOfBounds Exception: Index 2 out of bounds for length 2at Swapper.swapFirstAndSecondHalf (Swapper.java:15)at Swapper. check (Swapper.java:35)at SwapperCodeCheck.main (SwapperCodeCheck.java:38)Exception in thread "main" java.lang. ArrayIndexOutOfBounds Exception: Index 2 out of bounds for length 2at Swapper.swapFirstAndSecondHalf (Swapper.java:15)at Swapper. check (Swapper.java:35)at SwapperCodeCheck.main (SwapperCodeCheck.java:48)[]Expected[3, 4, 1, 2][4, 5, 3, 1, 2][]

This program is a java program. So we can use System.arraycopy() instead of all for a loop. So, we…

This method swaps the first and second half of the given array. @param values an array */ public void swapFirstAndSecondHalf(int[] values) { } int[] first = new int[values.length/2]; int[] second = new int [values.length/2]; for (int i = 0; i < values.length/2; i++) { second[i] = values[i]; } for (int j values.length/2; j < values.length; j++) { first[j] = values[j]; } for (int k = 0; k < values.length / 2; k++) { values[k] = first[k]; } for(int 1 = values.length / 2; 1 < values.length; l++) { values [1] = second [1]; }

This method swaps the first and second half of the given array. @param values an array */ public void swapFirstAndSecondHalf(int[] values) { } int[] first = new int[values.length/2]; int[] second = new int [values.length/2]; for (int i = 0; i < values.length/2; i++) { second[i] = values[i]; } for (int j values.length/2; j < values.length; j++) { first[j] = values[j]; } for (int k = 0; k < values.length / 2; k++) { values[k] = first[k]; } for(int 1 = values.length / 2; 1 < values.length; l++) { values [1] = second [1]; }

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

public int[] selectionSort(int[] array) {for (int i = 0; i < array.length - 1; i++) {int min = array[i];int minIndex = i;for (int j = i + 1; j < array.length; j++) {if (min > array[j]) {min = array[j];minIndex = j;}}if (minIndex == i) {array[minIndex] = array[i];array[i] = min;}}return array;}
void shiftLeft(int array[], int size, int& numUsed, int index) { index = array[0]; for(int i = 1; i <= size - 1; i++) { array[i - 1] = array[i]; } array[size-1] = index; } void shiftRight(int array[], int size, int& numUsed, int index) { index = array[numUsed-1]; for(int i = numUsed - 2; i >= 0; i--) { array[i + 1] = array[i]; } array[0] = index; } how do i fix my shift right function.
void showArray ( int a[ ], int size ); // shows the array in the format "int a [ ] = { 3, 7, 4, ... ,5, 6, 3} void showReverse ( int a[ ], int size ); // shows the array in reverse "int a [ ] = { 3, 6, 5, ... , 4, 7, 3 } " int lowest ( int a[ ], int size ); // finds and returns the lowest value in the array (should be 3) int highest ( int a[ ], int size ); // finds and returns the highest value in the array (should be 7) int sumArray ( int a[ ], int size ); // calculates and returns the sum of all values in the array float averageVal ( int a[ ], int size ); // calculates and returns the average of all values in the array int count5 ( int a[ ], int size ); // returns how many times the number 5 appears in the array int firstMinusLast ( int a[ ], int size ); // returns the difference b/w the First and Last Array Element void showBeforeIndex( int a [ ], int index); // shows all array values before a specific index void done…
84. Refer to the following method that finds the largest value in an array. /** Precondition: arr is initialized with int values. * @param arr the array to be processed * @return the largest value in arr */ public static int findMax(int[] arr) { int max = /* some value */; 0; int index %3D while (index max) arr[index]; max = index++; return max; } Which replacement(s) for /* some value */ will always result in correct execution of the findMax method? Integer. MIN _VALUE III. I. II. Integer.MAX_VALUE arr[0]
Assume that the following program segment is executed. What is the last element of testArray2 after the execution of the statement sortArray1(testArray2);? *
public int[] bubbleSort(int[] array) {int n = array.length;int temp = 0;}
java getDup accepts an array and returns an int. If there is any element is duplicated, the method counts how many of those present in the array. Example : getDup(["1","2","aa"',"1"]) returns:2 ("1" is duplicated and there are two "1"s so return is 2) class Main { public static int getDup(String[] r) { } public static void main(String[] args) { Scanner in = new Scanner(System.in); String [] strs = new String[in.nextInt()]; for(int i=0; i < strs.length; i++) { strs[i] = in.next(); } System.out.println(getDup(strs)); } } hint: you will need a nested array the will run on the array we get from the method argument. inside the nested loop you will need to check if the main array element is equal to the current
using System;public static class Lab8{ public static void Main() { int[] compStats = new int[25]; int n = 0, large, small; double avg = 0; // Input values into the array InpArray(compStats, ref n); // Find the average of the elements in the array // *** Insert the code for the call to the FindAverage method // Find the largest element in the array // *** Insert the code for the call to the FindLarge method // Find the largest element in the array // *** Insert the code of the call to the FindSmall method // Print out the results Console.WriteLine("\nThe Average of the array is {0:F}", avg); // *** Insert the code to print out the largest and smallest values // Pause until user is done Console.ReadLine(); } // Method: InpArray // Description: Input values into an array. // Parameters: arrValues: the array to fill. // num: number of elements in the array. //…
8. Repetition Use Python Language Write a method that takes in an array as a parameter and counts the repetition of each element. That is, if an element has appeared in the array more than once, then its 'repetition' is its number of occurrences. The method returns true if there are at least two elements with the same number of 'repetition'. Otherwise, return false. Input: {4,5,6,6,4,3,6,4} Output: True Explanation: Two numbers repeat in this array: 4 and 6. 4 has a repetition of 3, 6 has a repetition of 3. Since two numbers have the same repetition output is True. Input: {3,4,6,3,4,7,4,6,8,6,6} Output: False Explanation: Three numbers repeat in this array:3,4 and 6 .3 has a repetition of 2, 4 has a repetition of 3, 6 has a repetition of 4. Since no two numbers have the same repetition output is False.
Assume that the following program segment is executed. What is the first element of testArray3 after the execution of the statement sortArray2(testArray3);? *
Method Details: public static void rotate(int[] array, boolean leftRotation, int positions) Rotates the provided array left if leftRotation is true; right otherwise. The number of positions to rotate is determined by positions. For example, rotating the array 10, 20, 7, 8 two positions to the left will update the array to 7, 8, 10, 20. Only arrays with 2 or more elements will be rotated. Hint: adding private methods that rotate an array one position to the left and one position to the right can help. Parameters: array - leftRotation - positions - Throws:java.lang.IllegalArgumentException - When a null array parameter is provided
public int binarySearch(int[]array, int num) {int low = 0;//low rangeint high = array.length -1; //high range int mid; //mid rangewhile () //while low is less than or equal to high{mid = ; //set middle range to be (low + high) /2if () { //if the array in the middle range = input number//return mid range }elseif () { //if the array in the middle range > input number//set the high value to be the mid value minus 1 }else{//set low value to be mid value plus one } }//return -1 here because that would mean that the number is not found in the loop}