Comment Re:Technical Objections by Armchair Engineer? (Score 1) 370
That's right. Instead of 33 seek steps for 10 GB (which is O(log n) time) you can do it in about 5 steps (O(log log n) time) with the algorithm above.
Man is an animal that makes bargains: no other animal does this-- no dog exchanges bones with another. -- Adam Smith
