Sorting algorithms/Insertion sort: Difference between revisions
m
→{{header|RPL}}
m (→{{header|RPL}}) |
|||
Line 4,524:
=={{header|RPL}}==
In RPL, the condition <code>while j > 0 and A[j] > value do</code> needs to be fully assessed before performing the loop: an error would then occur when j will equal zero. This is why the loop condition has been encapsulated in a <code>IFERR..THEN..END</code> structure, which removes the need to test the value of j.
{{works with|Halcyon Calc|4.2.7}}
{| class="wikitable"
| |||