1. The invariant of the insertion sort

defines that the data structure is always partially sorted at the "left"

No element is ever larger than its successor when the array is not completely sorted

Using a counter in for loops should not entail declaring the counter in the for header

The insertion sort (unlike the Quicksort) has no invariant

2.

The invariant of the binary search

Defines that the data structure be only in dynamic form (arrays not allowed)

Makes it impossible to determine when the data structure is sorted

The data structure must be in sorted form

The data structure has to be sorted based on memory address as opposed to key element values

3.

Binary search has O(ln n) time complexity. This means that for each division of the data structure, there are exactly two places that the element sought can be found; in both the upper and lower divisions created by the algorithm.

This statement is partially true; binary search always has to remember the portion of the data structure not in focus

Always

Never

While this statement is true, there are other factors to consider which posit sufficiency