1. Describe the algorithm to solve the problem for a given file of size 25 first, and then describe
the algorithm for a given file of size 2x
(any given x). Note that x is a unsigned integer where
x > 0. You can use tables, diagrams, paragraph description….. to describe the algorithm. Be
as clear as possible, and define clearly each step taken during the process
2. Write the pseudocode that represents your algorithm from problem (1).
3. Compute the complexity function, the I/O cost of operations, and the Θ(g(n)) time complexity of your algorithm using your pseudocode from problem (2). For the complexity function
and time complexity use the substitution method and then check your result with the
Master Theorem. For the I/O cost define it as a function of N. Where N is the number of
blocks (4KIB) in pass 0 of this algorithm
0 comments