Below is your exercise for Basic Sorts. For submitting your answers, you can either send me an updated Word document with your answers, email your answers directly, or even take a screen shot of your work on paper if you like. In all cases, email me your answers when you feel ready. Use the following array of numbers for each of the sorting tasks below: 6 2 8 1 7 5 3 4 Bubble Sort (not optimized) – show what the array looks like each time the swap operation is performedusing the bubble sort algorithm (not optimized, meaning no use of swapFlag) Selection Sort - show what the array looks like each time the swap operation is performed using the selection sort algorithm Insertion Sort – show what the array looks like at the end of each outer loop iteration of the insertion sort algorithm

Below is your exercise for Basic Sorts. For submitting your answers, you can either send me an updated Word document with your answers, email your answers directly, or even take a screen shot of your work on paper if you like. In all cases, email me your answers when you feel ready. Use the following array of numbers for each of the sorting tasks below: 6 2 8 1 7 5 3 4 Bubble Sort (not optimized) – show what the array looks like each time the swap operation is performedusing the bubble sort algorithm (not optimized, meaning no use of swapFlag) Selection Sort - show what the array looks like each time the swap operation is performed using the selection sort algorithm Insertion Sort – show what the array looks like at the end of each outer loop iteration of the insertion sort algorithm

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

Below is your exercise for Basic Sorts. For submitting your answers, you can either send me an updated Word document with your answers, email your answers directly, or even take a screen shot of your work on paper if you like. In all cases, email me your answers when you feel ready. Use the following array of numbers for each of the sorting tasks below: 6 2 8 1 7 5 3 4 Bubble Sort (not optimized) – show what the array looks like each time the swap operation is performedusing the bubble sort algorithm (not optimized, meaning no use of swapFlag) Selection Sort - show what the array looks like each time the swap operation is performed using the selection sort algorithm Insertion Sort – show what the array looks like at the end of each outer loop iteration of the insertion sort algorithm
ABC zoo wants to keep track of how many pounds of food each of its four monkeys eats each day during a typical week. Stores this information in a two dimensional 4× 7 array, where each row represents a different monkey and each column represents a different day of the week. First let the user input the data of food eaten by each monkey then it should create a report that includes the following information: Average amount of food eaten by each monkey for the whole week. The least amount of food eaten during the week by any one monkey.
Consider the array below please provide the intermediate array applying the Count Sort Algorithm (Hint: not the Output Array or Input Array but Buffer Array that holds the counts of array elements). What should be the length of Count Array? 1. Input Array: 3 2 3 3 2 5 4 4 8.
Using the array shown below in the picture, show all the steps needed to sort the array. To sort the array you must use quick-sort to sort the array. Please show the final answer clearly and show detailed steps on how you got to the final answer.
Assume the array is sorted according to the roll number. Jonny, as a school teacher conducted the test in the class and students submitted responses along with time duration to complete the test. Now your task is to find the student number who taken the most time. In kotlin
Here are the sample runs. How many elements (the size) in the first array: 6 Enter the elements of the first array: 6 1 6 5 2 5 How many elements (the size) in the second array: 6 Enter the elements of the second array: 6 6 15 2 5 The two arrays are identical arrays How many elements (the size) in the first array: 6 Enter the elements of the first array: 6 6 6 5 2 5 How many elements (the size) in the second array: 6 Enter the elements of the second array: 6 6 1 5 2 5 The two arrays are not identical arrays How many elements (the size) in the first array: 6 Enter the elements of the first array: 6 1 6 5 2 5 How many elements (the size) in the second array: 5 Enter the elements of the second array: 6 16 5 2 The size of the two arrays are not equals
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.
Assignment 5A: Multiple Frequencies. In the last assignment, we calculated the frequency of a coin flip. This required us to have two separate variables, which we used to record the number of heads and tails. Now that we know about arrays, we can track the frequency of all numbers in a randomly generated sequence. For this program, you will ask the user to provide a range of values (from 1 to that number, inclusive) and how long of a number sequence you want to generate using that number range. You will then generate and save the sequence in an array. After that, you will count the number of times each number occurs in the sequence, and print the frequency of each number. Hints: You can use multiple arrays for this assignment. One array should hold the number sequence, and another could keep track of the frequencies of each number. Sample Output #1: What's the highest number you want to generate?: 5 How Long of a number sequence do you want to generate?: 10 Okay, we'll generate 10…
value You are given 4 items as {value, weightpairs in this format {{20, 5}, {60, 20}, {25, 10}, {X, 25}}You can assume that the array is sorted based on the ratio. The weight capacity of knapsack is 50. The item no. 4 (whose weightis 25 ) is taken fractionally to fill upto the knapsack capacity. That fraction is represented in format. What is the lowest possible value of b? For the question above, assume the total value stored in the knapsack is 135 after you have filled upto the knapsack capacity. What is the value of X(in other words, the valueof the item no. 4) ? Give your answer to at least two decimal places.
For this exercise, please calculate two values from all of the numbers in the two dimensional array. The first value should be the sum of all numbers in the array. This should be stored in a separate "int" variable that is created outside the nested FOR loops. The second value should be the total average of all numbers in the Array. This should be stored in a separate "float" variable, also outside the nested FOR loop structure. So, in short: • Display the sum of the values in the array • Then display the average of the values in the array Please refer to the sample output below for visualization and match its style. As always: • Remember, the class name should be Lab9B. The user input is indicated in bold. Sample Output #1: Please enter the number of rows: 3 Please enter the number of columns: 2 I have 3 rows and 2 columns. I need to fill-up 6 spaces. The 3x2 array: 1|2| 314| 516| The sum of all the numbers in the 3x2 array: 21 The average of all the numbers in the 3x2 array: 3.5…
Question 8 Sort the following numbers using an "in place" version of a selection sort. This means that you should have only one array throughout and all elements should be present at all times. Show each "pass" of the algorithm. 34, 25, 11, 44, 21, 8, 4, 28, 16, 31
Create 1 method to output the list of numbers. Output the list of numbers input by user. Output the average of all the numbers. Attach Snipping photos of source code and output. Task 2 Update above program. Create a Method that will return the largest element in the array. Attach Snipping photos of source code and output.