• require ceil(log₂b) passes to sort,
• each pass requires b page reads, b page writes

Example: Relation with r=10⁵ and c=50   ⇒   b=2000 pages.

Number of passes for sort:   ceil(log₂2000)  =  11

Reads/writes entire file 11 times!    Can we do better?