# Answer to Question #55925 in Java | JSP | JSF for Matts

Question #55925

When proving insertion-sort, the inner loop must be shifted all sorted elements bigger than the key by 1 place/location.

Give an appropriate loopinvariant for the inner loop and must prove that loop invariant is correct.

Give an appropriate loopinvariant for the inner loop and must prove that loop invariant is correct.

Expert's answer

#### Not answered

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment