X440: Sorting - Create Bubble Sort Write a function in Java that takes in the int [] array,sorts it using bubble sort, then returns back the sorted array. Examples: bubblesort({4,7,1}) -> {1,4,7} bubblesort({80,6,6,8,2}) -> {2,6,6,8,80} Your Answer: Feedba 1 public int(] bubbleSort(int[] array) { 2 int n - array.length; 3 int temp = 0; 0.0/ 1.0 4. Your answer line 8: err

X440: Sorting - Create Bubble Sort Write a function in Java that takes in the int [] array,sorts it using bubble sort, then returns back the sorted array. Examples: bubblesort({4,7,1}) -> {1,4,7} bubblesort({80,6,6,8,2}) -> {2,6,6,8,80} Your Answer: Feedba 1 public int(] bubbleSort(int[] array) { 2 int n - array.length; 3 int temp = 0; 0.0/ 1.0 4. Your answer line 8: err

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

Javascript Write the function popAndShift(). The function has to first print the the contents of the arrays array1 and array2. After this, the elements of array2 will be deleted, alternating between the .pop() and .shift() methods (starting with .pop()), while adding the removed values to the end of array1. Finally, the contents of array1 will be printed. Note! The automatic test takes care of assigning values to the arrays. Example output: First array: first,second Second array: third,fourth Resulting array: first,second,fourth,third The verification of program output does not account for whitespace characters like "\n", "\t" and "
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
(Java) 4.3 trace insertion sort on the first array. Optionally, you can also trace insertion sort on the second array You must show each intermediate step, labeled as Passes (see picture for an example). Hint: Use copy and paste to your advantage. 1. Trace insertion sort on the following array of data. int A[] = { 19, 3, 78, 79, 15, 45, 1}; Pass 1: 3, 19, 78, 79, 15, 45, 1 Pass 2: Pass 3: Pass 4: Pass 5: Pass 6: 2. Trace insertion sort on the following array of data. String A[] = { "bird", "bicycle", "ants", "cat", "array", "film", "brim", "elephant"}; Pass 1: "bicycle", "bird", "ants", "cat", "array", "film", "brim", "elephant" Pass 2: Pass 3: Pass 4: Pass 5: Pass 6: Pass 7: When you are finished, upload trace.doc/.docx/.odt/.txt
3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)
İN C PROGRAMMİNG Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10. Assume that each element represents a different city and the integers stored in the array represent the number of golds in those cities. The program traverses over the array and collects the golds at each city, starting from a random position. When the program visits a certain city, all of the golds are collected, and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues with the rule given below. If the position at the nth step is denoted by pn, and the number of golds at the city pn is denoted by gn, ??+1 ={|(?? +??) ???1000|, ?????2=0. |(?? − ??) ??? 1000|, ????? 2 = 1 The program continues visiting cities until the last three visited city has no gold. The program, at each visit, should print out the following information: • The current city index (pn). • The previous city index (pn-1). • The number of golds at the…
2.3 Write a program that allows you to create an integer array of 18 elements with the following values: int A[] = {3, 2, 4, 5, 6, 4, 5, 7, 3, 2, 3, 4, 7, 1, 2, 0, 0, 0}. Perform the following computations, a.Compute the sum of elements from index 0 to 14 and stores it at element 15 b.Compute the average of all numbers and stores it at element 16 c.Identifies the smallest value from the array and stores it at element 17 6.2 Create a Product class with Product Id & Product Name. Write a program to accept information of 10 products and store that in HashSet. Do following operations, a.Search a particular product in the HashSet.b.Remove a particular product from the HashSet by using product id.(Referbelow table for the product list) Product Id Product Name P001 Maruti 800 P002 Maruti Zen P003 Maruti Dezire P004 Maruti Alto 6.3 Implement LinkedListclass for this problema.Create an…
(Algebra: perfect square ) Write a program that prompts the user to enter an integer m and find the smallest integer n such that m * n is a perfect square. (Hint: Store all smallest factors of m into an array list. n is the product of the factors that appear an odd number of times in the array list. For example, consider m = 90, store the factors 2, 3, 3, 5 in an array list. 2 and 5 appear an odd number of times in the array list. So, n is 10.) Sample Run 1 Enter an integer m: 1500 The smallest number n for m x n to be a perfect square is 15 m x n is 22500 Sample Run 2 Enter an integer m: 63 The smallest number n for m x n to be a perfect square is 7 m x n is 441 Class Name: Exercise11_17 Answer is : import java.util.Scanner; public class Squares { public static void main(String[] args) { Scanner scan = new Scanner(System.in); //instantiation of Scanner that will take inputs from the keyboard //the try catch block below is for trapping error with the input try {…
9.1.1: Output numbers in reverse. Write a program that reads a list of 10 integers, and outputs those integers in reverse. For coding simplicity, follow each output integer by a space, including the last one. Then, output a newline. Ex: If the input is 2 4 6 8 10 12 14 16 18 20, the output is: 20 18 16 14 12 10 8 6 4 2 To achieve the above, first, read the integers into an array. Then output the array in reverse. CODES in Coral Language
solve in python coding 3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)
java: // Class to do MergeSort and QuickSort on int arrays and test them public class MergeQuickSorts { // Create a main to test MergeSort and QuickSort for // three cases - Sorted Aray, Reverse Sorted Array, Random Array // Each array should be size 50 // For the sorted array use the entries 1, 2, 3......50 // For the reverse sorted array use the entries 50, 49, 48.....1 // For the random array use ints between 1 and 50 inclusive, duplicates allowed // For each of the 6 sorts print the array before and after the sort // and show clearly which sort is being done public static void main(String[] args) { }
(Maximum element in an array) Implement the following method that returns the maximum element in an array . public static > E max (E[] list) Write a test program that prompts the user to enter 10 integers, invokes this method to find the max.
6. the grade is under 20 which is outlier, remove it from the array list. 7. Print array list using System.out.println() 8. Use indexOf to print index of 80. 9. Use get function. 10. What is the difference between get and index of? 11. Print the values of the array list using Iterator class. 12.. Delete all the values of the array list using clear function. 13. Print all the values of the array after you execute clear using System.out.println(). what is the result of using clear function? 14. What is the shortcoming of using array List?