If only one tape drive is available to perform the external sort

If only one tape drive is available to perform the external sorting, then the tape access time for any algorithm will be $$\Omega (N^2)$$. ~@[](2)

答案：TRUE