Implement one of the following sorts of your choosing to reorder values from least-to-greatest (i.e. ascending, starting with the first element): public static void bubbleSort(int[] values ) {...} public static void selectionSort( int[] values ) {...} public static void insertionSort(int[] values ) {...} You MUST include the method header in your response so that we can identify which sort you have chosen to implement. IMPORTANT: Your method should perform the sort in-place, meaning that the original array storing the unsorted values must be used to store the sorted values. You shouldn't require more than a single int variable to perform the in- place swapping of values. As such, you MAY NOT create a separate array (or other structure) to work with.

Implement one of the following sorts of your choosing to reorder values from least-to-greatest (i.e. ascending, starting with the first element): public static void bubbleSort(int[] values ) {...} public static void selectionSort( int[] values ) {...} public static void insertionSort(int[] values ) {...} You MUST include the method header in your response so that we can identify which sort you have chosen to implement. IMPORTANT: Your method should perform the sort in-place, meaning that the original array storing the unsorted values must be used to store the sorted values. You shouldn't require more than a single int variable to perform the in- place swapping of values. As such, you MAY NOT create a separate array (or other structure) to work with.

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

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}.
Java Implement 5 methods given below in MyStringArrayList class // Add a new element, e, at the beginning of this list public void addFront(String e){ } //search for element e, returns true if found, otherwise returns false. public boolean contains(String e){ } //return the element at position i, otherwise returns null public String getElement(int i){ } // remove the element at specified index, returns the element that is being removed. Returns null if specified index is invalid. public String removeElementAt(int i){ } //returns a String representation of this list. public String toString(){ }
Write a Java program to find continuous sub array of the given array whose sum is equal to a given number. For example, If {12, 5, 31, 9, 21, 8} is the given array and 45 is the given number, then you have to find continuous sub array in this array such that whose elements add up to 45. In this case, {5, 31, 9} is such sub array whose elements add up to 45.
FOR JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
Write a Java method named addArray which takes two arrays of same size as parameters. The method should return a third array that is the element-wise sum of the two arrays. For example, if the two input arrays are [1,2,3] and [4,5,6], then the returned array should be [5, 7, 9]. [ 1, 2, 3] + [ 4, 5, 6] = [1+4, 2+5, 3+6] = [5,7,9] Call addArray in main method to test the above example. Print the returned array in the main method. Write a JAVA code please
In java, Implement a method that removes all duplicates. Keep the first instance of the element but remove all subsequent duplicate elements.public void removeDuplicates() see the picture for the right output. Given files: Demo6.java public class Demo6 { public static void main(String[] args) { MyLinkedList<String> list = new MyLinkedList<>(); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); for (int x = 0; x < list.size(); x += 1 + x/3) { System.out.println("Removing element at index: " + x); list.remove(x); } System.out.println("Result"); System.out.println(list); System.out.println("Shuffling"); list.shuffle(7777); System.out.println(list); System.out.println("Removing duplicates (keeping first instance)"); list.removeDuplicates(); System.out.println(list); }} TestBench.java import java.util.AbstractList; public class TestBench { public static…
Given an arraylist of positive integers, write a java method to return the number of rotations to the right inorder to obtain the largest sequence of odd integers. Hint: the largest sequence of odd integers may be obtained after 0<= numRotations <= n-1. where n is the number of elements in the arraylist. Note: Rotating to the right means moving all elements one position to the right, i.e. element at position 0 will move to position 1 and element at position 1 will move to position 2 ... element at position n-1 will move to position 0.
Write a program that benchmarks QuickSort and InsertionSort. You should use at least 5 different data sets and record the performance of each algorithm on the same sets under the same conditions. Write a short report that compares the two algorithms based your results. It is important to include a discussion of the initial states of the data sets in your report. language Java public class week3 {public static void main(String args[]){ //========================================================== //Question 1 testing //================== // Comment on benchmarking for Q1 results // // //========================================================== } static void quickSort(int f[], int p, int q){ if(q-p <= 1) ; //skip else{ int x; int i, j, k; // let x = middle element in f[p..q-1] x = f[(p+q)/2]; //x = f[p]; i = p; j = p; k = q; while(j != k){ if(f[j] == x) j = j + 1; else if(f[j] < x){ //swap f[j] with f[i] int temp; temp = f[j]; f[j] = f[i]; f[i] = temp; j = j + 1; i = i + 1; } else{…
We were given the following code to solve a Pentomino puzzle, several methods might need to be added or editted to solve the problem. The program should take in an input of 3 4 5 6 for 3x20 4x15 5x12 6x10 grids. Then output the number of correct solutions for them (respectively its 2, 368, 1010, and 2339) import java.util.ArrayList;import java.util.LinkedList;import java.util.List; public class DLX { class DataNode { DataNode L, R, U, D; ColumnNode C; public DataNode() { L = R = U = D = this; } public DataNode(ColumnNode c) { this(); C = c; } DataNode linkDown(DataNode node) { node.D = this.D; node.D.U = node; node.U = this; this.D = node; return node; } DataNode linkRight(DataNode node) { node.R = this.R; node.R.L = node; node.L = this; this.R = node; return node;…
Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. Use the following files: Question.java /** A question with a text and an answer.*/public class Question{ private String text; private String answer; /** Constructs a question with empty text and empty answer. */ public Question() { text = ""; answer = ""; } /** Sets the answer for this question. @param correctResponse the answer */ public void setAnswer(String correctResponse) { answer = correctResponse; } /** Checks a given response for correctness. @param response the response to check @return true if the response was correct, false otherwise */ public boolean checkAnswer(String response) { return response.equals(answer); } /** Add a line of text to…
Write a Java method that takes two 2 dimensional int arrays (a and b) anda 2 dimensional boolean array (c) where all three arrays have the samesize. Your method should return an array (result) such that, if a particular element in c is true, then the corresponding (same indexed) elementin result must be the multiplication of the the corresponding elements ofa and b. If the element in c is false, then the the corresponding elementin result must be the negative of multiplication of the the correspondingelement in a and b.
Calculate the time complexity of the following issue and provide a method. Divide a list of n unique positive numbers into two sublists, each of size n/2, so that the difference in the sums of the integers in the two sublists is as large as possible. You may assume that n is a power of two.