Jump to content

Sorting algorithms/Insertion sort: Difference between revisions

Line 860:
 
===For arrays whose elements must not be of linear type===
 
This implementation finds the position at which the element is to be inserted, and then uses '''array_subcirculate''' to move it into place. The prelude's implementation of '''array_subcirculate''' is a '''memmove(3)'''.
 
<lang ATS>#include "share/atspre_staload.hats"
1,448

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.