Anonymous user
Sorting algorithms/Selection sort: Difference between revisions
Sorting algorithms/Selection sort (view source)
Revision as of 11:21, 31 October 2023
, 8 months agono edit summary
imported>StraightDoubt (I added a second example of selection sort in Rust. I think it uses slices to make the algorithm more explicit.) |
imported>Lacika7 mNo edit summary |
||
Line 867:
460 END
</syntaxhighlight>
==={{header|IS-BASIC}}===▼
<syntaxhighlight lang="is-basic">100 PROGRAM "SelecSrt.bas"▼
110 RANDOMIZE ▼
120 NUMERIC ARRAY(-5 TO 14)▼
130 CALL INIT(ARRAY)▼
140 CALL WRITE(ARRAY)▼
150 CALL SELECTIONSORT(ARRAY)▼
160 CALL WRITE(ARRAY)▼
170 DEF INIT(REF A)▼
180 FOR I=LBOUND(A) TO UBOUND(A)▼
190 LET A(I)=RND(98)+1▼
200 NEXT ▼
210 END DEF ▼
220 DEF WRITE(REF A)▼
230 FOR I=LBOUND(A) TO UBOUND(A)▼
240 PRINT A(I);▼
250 NEXT ▼
260 PRINT ▼
270 END DEF ▼
280 DEF SELECTIONSORT(REF A)▼
290 FOR I=LBOUND(A) TO UBOUND(A)-1▼
300 LET MN=A(I):LET INDEX=I▼
310 FOR J=I+1 TO UBOUND(A)▼
320 IF MN>A(J) THEN LET MN=A(J):LET INDEX=J▼
330 NEXT ▼
340 LET A(INDEX)=A(I):LET A(I)=MN▼
350 NEXT ▼
360 END DEF</syntaxhighlight>▼
=={{header|BCPL}}==
Line 2,027 ⟶ 2,056:
l := list(-1, 4, 2, -9)
l selectionSortInPlace println # ==> list(-9, -1, 2, 4)</syntaxhighlight>
▲=={{header|IS-BASIC}}==
▲<syntaxhighlight lang="is-basic">100 PROGRAM "SelecSrt.bas"
▲110 RANDOMIZE
▲120 NUMERIC ARRAY(-5 TO 14)
▲130 CALL INIT(ARRAY)
▲140 CALL WRITE(ARRAY)
▲150 CALL SELECTIONSORT(ARRAY)
▲160 CALL WRITE(ARRAY)
▲170 DEF INIT(REF A)
▲180 FOR I=LBOUND(A) TO UBOUND(A)
▲190 LET A(I)=RND(98)+1
▲200 NEXT
▲210 END DEF
▲220 DEF WRITE(REF A)
▲230 FOR I=LBOUND(A) TO UBOUND(A)
▲240 PRINT A(I);
▲250 NEXT
▲260 PRINT
▲270 END DEF
▲280 DEF SELECTIONSORT(REF A)
▲290 FOR I=LBOUND(A) TO UBOUND(A)-1
▲300 LET MN=A(I):LET INDEX=I
▲310 FOR J=I+1 TO UBOUND(A)
▲320 IF MN>A(J) THEN LET MN=A(J):LET INDEX=J
▲330 NEXT
▲340 LET A(INDEX)=A(I):LET A(I)=MN
▲350 NEXT
▲360 END DEF</syntaxhighlight>
=={{header|J}}==
| |||