This preview shows page 1. Sign up to view the full content.
Unformatted text preview: method faster by using binary search algorithm instead of sequencial search algorithms by doing this we also make the algorithm more efficent than part B. 3. Which case did perform the worst? Did you expect these results? Explain Part A has performed the worst. I expected this result; because at part A we have used the least efficent algorithm for making intersection files. For each record we have opened and closed a connection through the file. We also did not fetch the records in to our main memory....
View Full Document
This note was uploaded on 02/19/2011 for the course MATH 315 taught by Professor Selcuk during the Fall '10 term at Bilkent University.
- Fall '10