Question: 3. Consider the following algorithm: 1: procedure INVERT(1) 2 8+A 3: 3: 6: 7: 8: 9: afl while a A do 7+8 84-0 a
3. Consider the following algorithm: 1: procedure INVERT(1) 2 8+A 3: 3: 6: 7: 8: 9: afl while a A do 7+8 84-0 a LINK(3) LINK(3) +- Y end while 1-B 10: 11: end INVERT Let the precondition specification of the algorithm be as follows: Precondition: Given a singly linked linear list containing n nodes defined by node(INFO,LINK), where a, is contained in the th node, 1 isn. Let la, 3, y be pointers such that I points to the head node (containing ) of the list. (a) 2 points: Identify the postcondition specification. (b) 8 points: Prove the correctness of the algorithm.
Step by Step Solution
3.44 Rating (163 Votes )
There are 3 Steps involved in it
a Postcondition Specification The postcondition specification describes the state of the program after the execution of the algorithm For the given al... View full answer
Get step-by-step solutions from verified subject matter experts
