Assuming the existence of read Block and write Block functions, write a pseudocode program for shifting data to make a gap at some specified location of a sorted fi le. Pay particular attention to the details of shifting the last item out of one block and into the first position of the next block. You can assume that the last record of the fi le is in record last Rec of block last Block and that last Block is not full. (Note that this assumption permits shifting without allocating a new block to the fi le.)
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here