Library sort: Difference between revisions

Revision as of 22:42, 2 June 2018

Revision as of 11:28, 16 August 2018

Line 68:

insert A[j] at S[ins]

Here, <code>binarysearch(el, 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]el}}. Insertion should favor gaps over filled-in elements.

== References ==