Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted
(→‎{{header|REXX}}: restructured the body of the REXX program. -- ~~~~)
Line 1,514:
while(j >= 0 && a[j] > v){
a[j+1] = a[j];
j -= j-1;}
}
a[j+1] = v;}
}
return a;
}</lang>
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort"