Chapter 6, Problem 28E

Explanation of Solution

Showing loop invariants in a program:

• From the problem, loop invariant is a condition that is sure to be true with the loop on every iteration.
• It plays an important role axiomatic semantics. Invariants loops are used to write a correct code.
• The following program shows the invariants in curly braces.

  //Assigning l value

        l := 1

        //Assigning h value

        h := n+1

        //while condition

        while l < h

            //Invariants

            {l<h}

            //Invariants

            {t, if present, is in range [l..h)}

            //evaluating m value

            m = floor ((l+h)/2)

            //Invariants

            {l <= m < h}

            //if condition

            if t = X[m]

        ;&#x...