Disk Search / Sort Algorithm
- by AlgoMan
Given a Range of numbers say 1 to 10,000, Input is in random order.
Constraint:
At any point only 1000 numbers can be loaded to memory.
Assumption:
Assuming unique numbers.
I propose the following efficient , "When-Required-sort Algorithm".
We write the numbers into files which are designated to hold particular range of numbers. For example,…