Sorting algorithms/Selection sort: Difference between revisions
m
→{{header|GWBASIC}}
Line 703:
70 I=0: J=0: IMAX = 0: ITP! = 0: TL! = 0
80 '
90
130 IF IMAX > 1000 THEN IMAX = 1000
▲130 PRINT "This program does the Selection Sort Algorithm"
▲140 INPUT "Number of elements to sort (Max=1000, Enter=10)";IMAX
150
▲160 IF IMAX > 1000 THEN IMAX = 1000
170 FOR I=1 TO IMAX: N(I) = I: NEXT I
▲170 DIM N(IMAX)
180 FOR I=1 TO IMAX
▲190 RANDOMIZE TIMER
200
210
220 PRINT: PRINT "Unsorted list:";
220 NEXT I▼
230 FOR I=1 TO IMAX: PRINT N(I);: NEXT I
240 PRINT: PRINT
▲240 J = INT(RND*IMAX)+1
260
270
280
290
300 FOR I=1 TO IMAX-1
▲300 ' Sorts the list through the Selection Sort Algorithm and shows the results
310
350
360
370 ' Final results
▲370 IF N(I)>N(J) THEN SWAP N(I), N(J): ITP! = ITP! + 1
▲390 LOCATE ,X: PRINT ". Done!"
400
410
420
▲430 PRINT: PRINT: PRINT "Numbers sorted:"; IMAX
▲440 PRINT "Total permutations done:";ITP!
▲480 END
</lang>
|