• For the following algorithm, explain what it computes, state what the input size for analysis is, state what basic operations should be counted for analyzingit, state exactly how many operations are executed as a function of the input size, and state the efficiency class or classes to which it belongs. The built-inC++ swap function is extremely efficient, and you should count it as performing exactly two basic operations.01 void foo(vector& array)02 {size_t size = array.size();for (size_t pass_indx = 0; pass_indx < size - 1; pass_indx++){size_t min_position = pass_indx;for (size_t compare_indx = pass_indx + 1; compare_indx < size;compare_indx++){if (array.at (compare_indx) < array.at(min_position)){min_position = compare_indx;}}0304050607080910111213141516if (min_position !- pass_indx)17swap (array.at(pass_indx), array.at (min_position));1819}21 }20

The given code is used for sorting an array The algorithm that is used here is called bubble sort,…

Answered: •For the following algorithm, explain…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

Design a class to perform various matrix operations. A matrix is a set of numbers arranged in rows and columns. Therefore, every element of a matrix has a row position and a column position. If A is a matrix of 5 rows and 6 columns, we say that matrix A isof the size 5 × 6 and sometimes denote it as A5×6. Clearly, a convenient place to store a matrix is in a two-dimensional array. Two matrices can be added and subtracted if they have the same size. Suppose that A = [aij] and B = [bij] are two matrices of the size m × n, where aijdenotes the element of A in the ith row and the jth column, and so on. The sum and difference of A and B is given by: ?+ ?= [???+ ???]?− ?= [???−???]The multiplication of A and B (A * B) is defined only if the number of columns of A are the same as the number of rows of B. If A is of the size m × n and B is of the size n × t, then A * B = [cik] is of the size m × t and the element cikis given by the formula: ???= ??1?1?+ ??2?2?+ ⋯+ ??????Matrices A and B are…
Below is the exercise for unsorted arrays. True or False: For each statement below, indicate whether you think it is True or False 3) 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 5) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario 6) 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) 7) 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)
Question- Need solution in JavaSomething related to IPO offeringmain gist is we had shares - lets say N which we want to divide among biddersBidders are represented in 2d arrays as[bidder_id, no of shares_bid, price, timestamp]Now build a function returns the bidder_id's in sorted array that did not receive any shares. Shares are allocated following rules- if the price is highest among all the bidders. Allocate shares If the price is same among 2 bidders. Allocate share in iterative fashion, first one get share had earlier timestamp.Like 2 bidders with bidder id 1&2, have same price, timestamp 4 and 1, bids for 5 shares each and N=1.So, in this case only bidder id 1 get share, bidder id 2 will not recieve any shares
Below are some statements about Quicksort and Heapsort. Which of the statements is correct when sorting a large number of elements? A. Heapsort and Quicksort have the same time complexity in the mean case.B. When implementing Quicksort, an extra array is usually used in addition to the one on which the sorting is performed.C. If the first element is selected as the pivot element at Quicksort, Quicksort will be faster than Heapsort when the sequence to be sorted is already almost sorted.D. Heapsort performs the sorting on linear time at its best. Group of answer options All statements except B are correct Only statements A and C are correct Only statement A is correct All statements except D are correct All statements are correct
Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7
To get the necessary excess space down to max(M, N/M), create a merging implementation based on the following concept: Divide the array into N/M blocks of size M in order to keep things simple, and assume that N is a multiple of M. The blocks are then (i) sorted using selection sort, which treats them as items and uses their first key as the sort key, and (ii) merged as the array is iterated through. The first block is merged with the second, the second block with the third, and so on.
can you please convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is 0 we have reached our goal if row[pos] == 0: possible = True else: # make a copy of the visited array visited = visited[:] # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - row[pos] > 0 and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in…
Reference the image below.(a) Write a code in python to implement Hoare's algorithm.(b) Using LArray = {36, 12, 39, 34, 89, 2, 47, 95, 17, 19, 78, 22} as input, display the finaloutput and the array LArray after it has been manipulated by the algorithm.(c) Modify the algorithm to display the LArray after each swap done, being sure to indicatewhat swap is being observed.
2.) Revise the function quickSort so that it always chooses the last item in the array as the pivot. Add a counter to the function partition that counts the number of comparisons that are made. Compare the behavior of the revised function with the original one (pivot should be selected using sortFirstMiddleLast algorithm), using arrays of various sizes. At what size array does the difference in the number of comparisons become significant? For which pivot selection strategy does the difference in the number of comparisons become significant? Compare your analysis with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8192, 16384 <time.h> and clock() function. For comparison, you need to create two tables for execution times and a counter for both algorithms
Select true or false for the statements below. Explain your answers if you like to receive partial credit 9) Which of the following is true about the Mergesort algorithm applied to an array ofnumbers that are all different?a. Memory usage is efficient because all swaps take place within the same arrayb. Performance is consistently at O(n log n) for all array scenariosc. When the partition function completes on the array, the pivot element willalways be in the exact center of the array
Answer the following as completely as possible in your own words:1. Explain how an array is sent to a function as a parameter.2. State which parameters should almost always be sent to any function which modifies an array. Explain why.3. Explain the similarity between index notation and pointer arithmetic.
Talk about the difference of accessing elements in an array VS access the memory address of an array What will happen with the following code: 1: cout << array<<endl; 2: cout << array[0] << endl; Does C++ support Index Out of bound Checking? If so, please explain how that works, if not, explain what will happen if Index Out of bound happens.

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning