all >= we should rememberhoweverthe concreteness of the inductive technique it shows thatfor any particular nthere is finite step-by-step sequence of implications that starts with something true and leads to the truth about in shortthe inductive argument is formula for building sequence of direct justifications loop invariants the final justification technique we discuss in this section is the loop invariant to prove some statement about loop is correctdefine in terms of series of smaller statements , where the initial claims is true before the loop begins if - is true before iteration ithen will be true after iteration the final statements implies the statement that we wish to be true we havein factseen loop-invariant argument in section (for the correctness of algorithm arraymax)but let us give one more example here in particularlet us consider using loop invariant to justify the correctness of arrayfindshown in code fragment for finding an element in an array code fragment algorithm arrayfind for finding given element in an array to show that arrayfind is correctwe inductively define series of statementss that lead to the correctness of our algorithm specificallywe claim the following is true at the beginning of iteration of the while loops is not equal to any of the first elements of