Jump to content

Sorting algorithms/Insertion sort: Difference between revisions

m
→‎{{header|REXX}}: changed a comment.
m (→‎{{header|REXX}}: used a separate variable for number of entries in array.)
m (→‎{{header|REXX}}: changed a comment.)
Line 1,789:
do #=1 while @.#\=='' /*find how many entries in array.*/
end /*#*/ /*short and sweet DO loop, eh? */
#=#-1 /*because of DO, adjust high# itementries*/
return
/*──────────────────────────────────INSERTIONSORT subroutine────────────*/
Cookies help us deliver our services. By using our services, you agree to our use of cookies.