)Binary Insertion sort Basic idea: there are number of n sequential objects vIOL vIIL,.,VIn-l in the seqlist, Insertion sort makes use of the fact that elements in position 0 through i-I are already in sorted order. use binary search to find the inserting position of vi when insert element vi Algorithm of binary insertion sort➢Binary Insertion sort Basic idea: there are number of n sequential objects V[0], V[1], …, V[n-1] in the SeqList,Insertion sort makes use of the fact that elements in position 0 through i-1 are already in sorted order. use binary search to find the inserting position of V[i] when insert element v[i]. Algorithm of binary insertion sort