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 18:00
In triangle △abc, ∠abc=90°, bh is an altitude. find the missing lengths. ah=4 and hc=1, find bh.
Answers: 3
question
Mathematics, 21.06.2019 20:30
Kayaks rent for $35 per day. which expression can you use to find the cost in dollars of renting 3 kayaks for a day?
Answers: 1
question
Mathematics, 21.06.2019 23:30
Can someone, me with this.i really need with this
Answers: 3
question
Mathematics, 21.06.2019 23:40
Which set of side lengths form a right side? a) 3ft,6ft,5ft b)50 in,48in,14in c)53m,48m,24m d)8cm,17cm,14cm
Answers: 2
You know the right answer?
Consider the bucket sort algorithm. the pseudocode1 for bucket sort is given below. bucket-sort(a) 1...
Questions
question
Mathematics, 19.10.2020 18:01
Questions on the website: 13722366