A file of 4096 blocks is to be sorted with an available buffer space of 64 blocks. How many passes will be needed in the merge phase of the external sort-merge algorithm?
What will be an ideal response?
We first need to compute the number of runs, n , in the merge phase.
R
Using the formula in the text, we have
Computer Science & Information Technology
You might also like to view...
The following is an example of a(n) ___________________ case for a summation algorithm (the sum of the numbers from 0 to n): If n > 0 then summation(n) = n + summation(n-1)
Fill in the blank(s) with the appropriate word(s).
Computer Science & Information Technology
Which of the following is not an algorithm?
a. A recipe. b. Operating instructions. c. Textbook index. d. Shampoo instructions (lather, rinse, repeat).
Computer Science & Information Technology