Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted
m (→‎{{header|REXX}}: used a separate variable for number of entries in array.)
m (→‎{{header|REXX}}: changed a comment.)
Line 1,789: Line 1,789:
do #=1 while @.#\=='' /*find how many entries in array.*/
do #=1 while @.#\=='' /*find how many entries in array.*/
end /*#*/ /*short and sweet DO loop, eh? */
end /*#*/ /*short and sweet DO loop, eh? */
#=#-1 /*because of DO, adjust high item*/
#=#-1 /*because of DO, adjust # entries*/
return
return
/*──────────────────────────────────INSERTIONSORT subroutine────────────*/
/*──────────────────────────────────INSERTIONSORT subroutine────────────*/