Trace counting sort algorithm as it sorts the array into an ascending order.ASSUMPTION: (1) Each data element (i.e., a[i]) is associated with a complicated object. As discussed, counting sort with a simple frequency count does not work.(2) Show how to guarantee the stability of repeating values. As we did in the class, please use a subscript to specify the order of the same keved values.(3) Show the steps as detail as possible.A = [ 4 1 3 1 4 3 2 3 ]

Trace counting sort algorithm as it sorts the array into an ascending order.ASSUMPTION: (1) Each data element (i.e., a[i]) is associated with a complicated object. As discussed, counting sort with a simple frequency count does not work.(2) Show how to guarantee the stability of repeating values. As we did in the class, please use a subscript to specify the order of the same keved values.(3) Show the steps as detail as possible.A = [ 4 1 3 1 4 3 2 3 ]

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 12PP: (Data processing) The answers to a true-false test are as follows: T T F F T. Given a twodimensional...

See similar textbooks

Similar questions

Help I will thumbs up! Help needed with a data structures question: (a) Using the fact that you can sort a 5-long array of numbers with 7 comparisons, describe an algorithm that can sort a 7-long array with 13 comparisons; and explain using plain English and avoid drawings. (b) Then prove that the algorithm in (a) is optimal, in the sense that you need at least 13 comparisons to sort a 7-long array of numbers.
Double trouble def double_trouble(items, n): Suppose, if just for the sake of argument, that the following operation is repeated n times for the given list of items: remove the first element, and append that same element twice to the end of items. Which one of the items would be removed and copied in the last operation performed? Sure, this problem could be finger-quotes “solved” by actually performing that operation n times, but the point of this exercise is to come up with an analytical solution to compute the result much faster than actually going through that whole rigmarole. To gently nudge you towards thinking in symbolic and analytical solutions, the automated tester is designed so that anybody trying to brute force their way through this problem by performing all n operations one by one for real will run out of time and memory long before receiving the answer, as will the entire universe. To come up with this analytical solution, tabulate some small cases (you can implement the…
(Recursive Selection Sort) A selection sort searches an array looking for the smallest elementin the array. When that element is found, it’s swapped with the first element of the array. The process is then repeated for the subarray, beginning with the second element. Each pass of the arrayresults in one element being placed in its proper location. This sort requires processing capabilitiessimilar to those of the bubble sort—for an array of n elements, n – 1 passes must be made, and foreach subarray, n – 1 comparisons must be made to find the smallest value. When the subarray beingprocessed contains one element, the array is sorted. Write a recursive function selectionSort toperform this algorithm
4. ALGORITHM FindSomething(A[0..n-1]) // Input: An array A[0..n-1] of real numbers > 0 if n = 1 return A[0] else val1  FindSomething(A[0.. n-2]) if val1 <= A[n-1] return val1 else return A[n-1]a) What does the algorithm do?b) Assume that the basic operations are the comparisons. Construct arecurrence relation C(n) that gives the number of times the basic operation isexecuted for an input of size n. Clearly state the initial condition.c) Solve the recurrence relation C(n) using the Master Theorem (if applicable) orback substitution. Show all of the steps.d) What is the basic time efficiency of this algorithm? Use Θ notation.
Quicksort SPLIT (the 2-pointer algorithm covered in class) is applied to the integer array [4,3,5,7,9,2,1], using the first entry as the pivot. Show the series of item swaps that are performed in the split process, and the array after each of these swaps, up to and including the step of placing the pivot at its correct location. You only need to show the split of the original array, you are not required to continue working on the subarrays after the split.
Data structure ( C++ ). I want to ask If my answer for this question is correct or not ? 5. Write an algorithm of consecutive searching of elements in an array (Searching of one element equal to the given element (by barrier method); i=0; A[n]=X; while (A[i]!=X) i++; if(i==n) cout<<"NO"; else cout<<"YES "<i;
Computer Science 1)What are the steps in the selection sort algorithm? Group of answer choices Split the array into two subarrays, sort each subarray, and append the two arrays together. Starting at index 0, search the entire array to find the smallest value and swap the smallest value with the value at index 0. 2)Suppose there an integer threshold such that the expression n2 is equal to the expression 9n-8 at that threshold, and is larger for all integers values larger than the threshold. What does this mean?
C++ Coding Assignment: Redo the 8 queens 1-dimensional array program with backtracking by REMOVING ALL GOTO's, but implementing the same algorithm. GIVEN C++ CODE - WITH GOTO's: #include <iostream>using namespace std; int main() { int q[8], c=0; q[0] = 0; // place a queen in row 0 of column 0 int counter = 0; // to count solutions // c: column as q[c]: row in column c next_col: ++c; // or c++; // next column if(c==8) goto print; q[c]=-1; // 0 next_row: ++q[c]; // or q[c]++; // next row if(q[c]==8) goto backtrack; for(int i=0; i<c; ++i) if(q[i]==q[c] || (c-i)== abs(q[c]-q[i])) // || = row test OR diagonal tests goto next_row; goto next_col; backtrack: --c; // or c-- if(c==-1) // once we backtrack to column -1, we have all the solutions. return 0; // ends the program goto next_row; print: counter++; // new solutions cout << counter << ":" << endl; for(int…
(Data processing) The answers to a true-false test are as follows: T T F F T. Given a twodimensional answer array, in which each row corresponds to the answers provided on one test, write a function that accepts the two-dimensional array and number of tests as parameters and returns a one-dimensional array containing the grades for each test. (Each question is worth 5 points, so the maximum possible grade is 25.) Test your function with the following data:
4. Insertion Sort• The idea with an insertion sort is that a sorted region grows one item at atime, by inserting an item into its correct position within the sorted region.• As done in Part 1, fill an array with random numbers.• Write a function that inserts an item into a sorted region of an array. Passthe function the index of the item to be inserted (i.e. the index of the firstitem in the unsorted region). Insert that item by shifting items over oneposition, until you have found the correct location to insert the item.• E.g. if given a = [2 5 8 9 6 3 7] and the index 4, a[4] should be inserted into thesorted portion, giving [2 5 6 8 9 3 7]• Write a second function that calls the first function repeatedly, until theentire array is sorted. (Each time the first function is called, it will insert anitem into a larger sorted region.)
Quicksort Draw annotated arrays for a call to partition. except use initial array values {6, 8, 1, 9, 3, 4, 2, 5}. Make sure you understand the notation and when to switch to the next diagram (after highTurn changes values). The last diagram should be the one in which the pivot has been copied back to the array. Also, say what the return value is.
Describe the need for an array when processing items that are thesame data type and represent the same conceptual item. Describe some common operations typically performed on arrays. Explain the consequences of using an array index that is out of boundsand discuss some common coding errors that can result in an out ofbounds array index. Explain in more detail why C++ only allows arrays to be passed asreference parameters.