← Back to Users
I(0-0)I's activity in the archive.
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.
Slashdot Mirror
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.