Content deleted Content added
Line 68:
insert A[j] at S[ins]
Here, <code>binarysearch(A, k)</code> performs [[binary search]] in the first {{mvar|k}} elements of {{mvar|A}}, skipping over gaps, to find a place where to locate element {{mvar|A[j]}}. Insertion should favor gaps over filled-in elements.
== References ==
| |||