0
$\begingroup$

I have read from the following references about Distribution Sort: https://users.cs.duke.edu/~reif/courses/alglectures/vitter.papers/Vit.IO_survey.pdf (5.1. Sorting by Distribution)

https://en.wikipedia.org/wiki/External_sorting#cite_note-Aggarwal88-6 (Part for External Distributtion sort)

https://en.wikipedia.org/wiki/Cache-oblivious_distribution_sort

and i can't understand

1)What affects the number of split elements in Distribution Sort? 2) What would be the ideal value of count in relation to the number of D disks? (In an external memory model). Why it is sqrt(D), D = number of Disks ; How it calculated ?

$\endgroup$
0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.