Let suppose that we have a file with n = 10^6 records. The block size is B = 10 records and we have available main memory m = 20 blocks. (Sorting with MergeSort)
a) If we have 1 disk find minimum available to sort file in 2 passes b) If we have 2 disks how many passes we need to sort the file completely
I have started to read about external sorting and i am confused about how to answer this questions. I don't know how to think about to solve it.
I read the solution of this exercise 1 which is in the textbook that i read https://www2.cs.duke.edu/courses/spring03/cps216/lectures/rec-03-quiz.pdf
and i am confused about the connection of terms in 2 exercises. So i need some help to solve the questions that are solved in the link-file but with my data.