Number of seeks in an I/O efficent algroithm
You're missing the trivial point that the input is on disk, and needs P seeks to be read, while the output needs to go to disk and needs Q seeks to be written. (Or 1+1 in the cases they're contiguous on disk). 

This is just setting the baseline; when you exceed the internal memory size you'll need more seeks to write out temporary data structures.