Question: Suppose you plan to use Indexed Sequential Search, there are n data items in a file and k subfiles. You may assume that k is
Suppose you plan to use Indexed Sequential Search, there are n data items in a file and k subfiles. You may assume that k is roughly n^(1/2)
What is the O(g(n)) cost to access any given record if you use sequential search on the index?
What is the O(g(n)) cost to access any given record if you use binary search on the index?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
