Please match each question with its best answer. Answers may be used more than once. Question Selected Match Uses both a do-while loop and a for loop G. Bubble sort Probably makes fewer swaps to sort an array F. Selection Sort Uses nested loops D. Both bubble sort and selection sort Compares side by side elements to see if they need to swap H. Sequential sort Can sort Strings, chars, doubles, and ints D. Both bubble sort and selection sort When sorting in ascending order, the smallest element is put into place first D. Both bubble sort and selection sort When sorting in ascending order, the largest element is put into place first A. Neither Bubble Sort nor Selection Sort

Please match each question with its best answer. Answers may be used more than once. Question Selected Match Uses both a do-while loop and a for loop G. Bubble sort Probably makes fewer swaps to sort an array F. Selection Sort Uses nested loops D. Both bubble sort and selection sort Compares side by side elements to see if they need to swap H. Sequential sort Can sort Strings, chars, doubles, and ints D. Both bubble sort and selection sort When sorting in ascending order, the smallest element is put into place first D. Both bubble sort and selection sort When sorting in ascending order, the largest element is put into place first A. Neither Bubble Sort nor Selection Sort

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 4RQ

See similar textbooks

Similar questions

True or False For each statement below, indicate whether you think it is True or False If you have an array with no “holes”, the append function performs at O(1) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario True If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)
True or False For each statement below, indicate whether you think it is True or False If you have an array with no “holes”, the append function performs at O(1) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1)
Median Function – In statistics, the median of a set of values is the value that lies in the middle when the values are arranged in sorted order. If the set has an even number of values, the median is the average of the two middle values. Your program should start with two arrays of integers containing the following values: Even numbered array: 17 32 45 68 99 101 67 89 22 27 Odd numbered array: 17 32 45 68 99 101 67 89 22 Using a sort function of your choice, first sort the arrays. NOTE: you may use the Standard Template Library sort function or your own sort function. Then, write a function that determines the median of a sorted array. The function should take an array of numbers and an integer indicating the size of the array and return the median of the values in the array. The same function should be called twice – once for the even array and once for the odd array. Your program should also have a printArray function that can be used to print the sorted array. (It…
=' =Trace bucket sort algorithm as it sorts the array into an ascending order. ASSUMPTION: (1) Use four buckets that have the ranges specified as follows: %3D [0,25), [25,50), [50,75), and [75,100), respectively (2) Show (or explain) the steps as detail as possible. If needed, please illustrate the steps. A =[ 78 17 39 26 72 94 21 12 68 ] 29
Ch7 - Arrays java In a loop, ask the user to enter 10 integer values and store the values in an array. Pass the array to a method. In the method, use a loop to subtract 5 from each element and return the changed array to the main method.In the main method, use a loop to add the array values and display the result.
Q: Integrate time function in insertion sort code and check time for 50,100 and 250 values Question: Inserting Sort #include<iostream>using namespace std;//swappingvoid swapping(int &a, int &b) { //variable declaration int temp;//swapping temp = a; a = b; b = temp;}//to display the arrayvoid display(int *array, int s) { //Loop for(int x = 0; x<s; x++) //Creating the array cout << array[x] << " "; cout << endl;}//Performing the selectionSortvoid selectionSort(int *array, int s) { //variable declaration int x, j, min; //loop for(x = 0; x<s-1; x++) { //used to minimum data min = x; for(j = x+1; j<s; j++) if(array[j] < array[min]) min = j; //placing the value swap(array[x], array[min]); }}//main of the codeint main() { //variable declaration int n; //input cout << "Enter the number of elements: "; //Storing the input cin >> n;…
Find primes This program creates and displays a 5x10 matrix(5 rows and 10 columns) of random integers between 1 and a maximum value(user input). Hint: Use the random library to generate each number and place it into your 2D list. The program then counts the number of prime numbers in each row of the array and displays this number, along with the found primes. The program finally displays the total number of prime numbers in the matrix.
Hands-On Activities Hands-On Activity 10-1 Write a pseudocode program that creates an array, prompts the user to enter five cities, and displays the array's contents. The contains five elements. Use a For loop to prompt the user to enter cities, and then use another For loop to display the contents. Save the file as cityArray.txt. array
This algorithm makes several passes through an array and causes the larger values togradually move toward the end of the array with each pass.a. bubble sortb. selection sortc. insertion sortd. sequential sort
Need to complete the intersection method. cant use the regular library and sort method. Please type answer note write by hend.
Parallel Arrays and Using Parallel Arrays -Using a loop to step through an array Declare Integer series [10] Declare Integer index For index = 0 to 9 Set series [index] =100 End For
Alphabet Random Walk• Write a program to generate a random walk that spans a 10*10 character array (The initial values of the elements are all.). The program must randomly walk from one element to another, moving one element position up, down, left or right each time. The elements that have been visited are labeled with the letters A through Z in the order in which they were visited