Find first missing positive: Difference between revisions

m
→‎{{header|REXX}}: fix syntax highlighting markup
m (→‎{{header|Phix}}: added syntax colouring, marked p2js compatible)
m (→‎{{header|REXX}}: fix syntax highlighting markup)
Line 896:
=={{header|REXX}}==
This REXX version doesn't need to sort the elements of the sets,   it uses an associated array.
<lang ringrexx>/*REXX program finds the smallest missing positive integer in a given list of integers. */
parse arg a /*obtain optional arguments from the CL*/
if a='' | a="," then a= '[1,2,0] [3,4,-1,1] [7,8,9,11,12] [1,2,3,4,5]' ,
10,333

edits