Assume that insertion sort is being run on the below array. The algorithm is about half way through its sorting of the array. What will the array look like after the next pass of the algorithm? Note: the bold part of the array indicates the part that has already been sorted by the algorithm. int A[] = { 80, 100, 110, 120, 90, 60, 120, 70}; O int A[] = { 60, 70, 80, 90, 100, 110, 120, 120 }; O int A[] = { 80, 90, 100, 110, 120, 60, 120, 70}; O int A] = { 90, 60, 120, 70, 80, 100, 110, 120}; O int A[] = { 70, 80, 100, 110, 120, 90, 60, 120}; int A[] = { 60, 80, 100, 110, 120, 90, 120, 70};

Assume that insertion sort is being run on the below array. The algorithm is about half way through its sorting of the array. What will the array look like after the next pass of the algorithm? Note: the bold part of the array indicates the part that has already been sorted by the algorithm. int A[] = { 80, 100, 110, 120, 90, 60, 120, 70}; O int A[] = { 60, 70, 80, 90, 100, 110, 120, 120 }; O int A[] = { 80, 90, 100, 110, 120, 60, 120, 70}; O int A] = { 90, 60, 120, 70, 80, 100, 110, 120}; O int A[] = { 70, 80, 100, 110, 120, 90, 60, 120}; int A[] = { 60, 80, 100, 110, 120, 90, 120, 70};

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.
Write code that loops through the array myVals. Each iteration: If myVals[i] is less than smallestNum, assign smallestNum with myVals[i]. Remember to assign smallestNum with some value before the loop.
1. Write a for loop to initialize the following array with value 0.0 double[] balances = new double [5] 2. Write a for-each loop to print out every element of the above array.
Array a= { 6,1,10, 9, 7, 4, 8, 2, 15 }; After the second iteration of the quick sort the array becomes O a. a=(4 1 2 67 9 8 10 15) O b.a= (2 1 4 6 7 9 8 10 15} O ca={6 1 4 27 9 8 10 15} on O d. a=[1 2 4 6 7 98 10 15)
Perform insertion sort on the following array: [5, 2, 1, 3, 6, 4]. Show what the array looks like after each iteration of the outer loop.
Following array is being sorted by Radix sort. Two iterations are already completed, What will be the new sequence after running the third iteration. 1, 7, 10, 9420, 3221, 5622, 4127, 2030, 3138, 743, 577, 9680, 82, 4793, 2599
23 37 56 74 80 90 112 114 123 129 208 249 266 270 271 Suppose you use binary search to search for the value 129 in the array above. Fill in the values for each iteration of the search. The first one is filled in as an example. Remember high and low store the indices that track which part of the array is being considered. Iteration 1: high: 14 low: 0 mid: 7 Iteration 2: high: low: mid: Iteration 3: high: low: mid:
Write the function average which returns the mean of the given array (that is, the sum divided by the length). Use an iterator loop. arrays.cpp 1 #include // size t 2 double average(const double* beg, const double* end) { double sum{0}; int count{0}; 3 4 7 8 10 return sum / count; 11 }
Hint: You can use any of these coaching to generate a random integer. Math ii. Random three Sort the array of random chars (using Arrays.sort()), and print out the ordered array the use of a for each loop 4 Implement a Linear Search to find out key in the random array of ints a. Use the unsorted array b. Keep music of the vary of comparisons that are made with this algorithm 5. Implement a Binary Search to find out key in the random array of chars a. Remember, you will have to make positive that the array is in ascending order in the past than trying to run a binary search. i. b. Keep track of the extensive range of comparisons that are made with this algorithm. e Include a observation interior your software program explaining WHY arrays want to be sorted in order to use binary search d. Generate output for the user. You need to include: Assignment: Write a complete Java software program that will search a random persona array for a key (A-2), and return the vary of searches completed…
Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass. The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position. Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…
Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass.The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position.Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…
C LANGUAGE Randomly generate 50 integers within the range of 0 – 999. Store the integers in an array.Pass the array to different functions that perform the tasks below:i. Print out the randomly generated integers in 5 rows, each row having 10 integer.Input: arrayreturn: none Random integer generation: #include<stdlib.h> rand(); //generate random integer rand()%999; //generate random integer between 0-999 ii. Show the range of integers generated: Output the smallest and largest integer and their index in the array.Input: arrayreturn: none iii. Sort the integers in ascending orderInput: arrayreturn: none findsmallestnumber(int start, int end, array)input: start index of array, end index of array, arrayreturn: smallest number index or position in array iv. Generate another array of 50 integers. Compare the 2 arrays and count the similarity percentage of the 2 arrays.Input: Array1, Array2Return: none ** Use 2 for loops for this function,…