Question discussion

A file has 10,000 records and a block holds 20 records. In the worst case, how many block accesses does a binary search on the sorted file…

A file has 10,000 records and a block holds 20 records. In the worst case, how many block accesses does a binary search on the sorted file need?

Correct answer: A

Explanation

The file occupies 500 blocks and ⌈log₂ 500⌉ = 9 block accesses are needed in the worst case.

Nobody has replied yet. Start the discussion!