subject
Mathematics, 12.12.2019 00:31 chasityn5648

Consider the bucket sort algorithm. the pseudocode1 for bucket sort is given below. bucket-sort(a) 1 2 3 4 5 6 7 8 9 10 (a) (b) n = a. length let b[0..n−1] be an empty array fori=0ton−1 make b[i] an empty list fori=0ton−1 insert a[i] into list b[hash(a[i])] / hashing function determines which bucket element goes into fori=0ton−1 sort list b[i] with insertion sort concatenate the lists b[0], b[1], . . , b[n − 1] together in order argue that the worst-case running time for bucket sort is o(n2). provide a scenario in which this happens. [5 pts] by replacing insertion sort with a more efficient mergesort or heapsort in line 9 of the pseudocode, bucketsort can achieve a worst-case running time of o(nlogn) instead of o(n2). argue why switching insertion sort to a more "efficient" sort is not a good idea. hint: when would you use bucket sort in the first place? [5pts]

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 17:20
Read the equations in the table below. then drag a description of the situation and a table to represent each equation. indicate whether each of the relationships is proportional or non-proportional.
Answers: 1
question
Mathematics, 21.06.2019 18:30
Which expression is not a polynomial?
Answers: 2
question
Mathematics, 21.06.2019 19:30
If (17, 4) is an ordered pair of the inverse of f(x), which of the following is an ordered pair of the function f(x)? a. (17,4) b. (4.17) c. (4,0) d. 0,17)
Answers: 2
question
Mathematics, 21.06.2019 23:50
What is 0.000008 meters in scientific notation
Answers: 1
You know the right answer?
Consider the bucket sort algorithm. the pseudocode1 for bucket sort is given below. bucket-sort(a) 1...
Questions
Questions on the website: 13722365