Rosetta Code

Sorting algorithms/Selection sort: Difference between revisions

Page Discussion

Sorting algorithms/Selection sort (view source)

Revision as of 12:20, 8 February 2024

405 bytes added ,  5 months ago
m
→‎{{header|Wren}}: Minor tidy
m (syntax highlighting fixup automation)
m (→‎{{header|Wren}}: Minor tidy)
 
(9 intermediate revisions by 6 users not shown)
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 1,337 ⟶ 1,366:
=={{header|EasyLang}}==
 
<syntaxhighlight lang="text">subr sort
proc sort . d[] .
for i = 0 to len data[] - 2▼
for min_posi = i1 to len d[] - 1
for j = i + 1 to len datad[] - 1
if datad[j] < datad[min_posi]
min_pos = swap d[j] d[i]
.
.
.
swap data[i] data[min_pos]
.
.
data[] = [ 29 4 72 44 55 26 27 77 92 5 ]
call sort data[]
print data[]</syntaxhighlight>
</syntaxhighlight>
 
=={{header|EchoLisp}}==
Line 1,521 ⟶ 1,550:
 
=={{header|Elena}}==
ELENA 56.0x :
<syntaxhighlight lang="elena">import extensions;
import system'routines;
Line 1,531 ⟶ 1,560:
var copy := self.clone();
for(int i := 0,; i < copy.Length,; i += 1)
{
int k := i;
for(int j := i + 1,; j < copy.Length,; j += 1)
{
if (copy[j] < copy[k])
Line 1,665 ⟶ 1,694:
let min, rest =
List.fold (fun (min,acc) x ->
if hx<min then (hx, min::acc)
else (min, hx::acc))
(x, []) xs
in min::ssort rest
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}}==
Line 3,288:
selection_sort(&mut array);
println!(" The sorted array is {:?}", array);
}
</syntaxhighlight>Another way:<syntaxhighlight lang="rust">
fn selection_sort<T: std::cmp::PartialOrd>(arr: &mut [T]) {
▲ for i =in 0 to.. arr.len() data[] - 2{
let unsorted = &mut arr[i..];
let mut unsorted_min: usize = 0;
for (j, entry) in unsorted.iter().enumerate() {
if *entry < unsorted[unsorted_min] {
unsorted_min = j;
}
}
unsorted.swap(0, unsorted_min);
}
}
</syntaxhighlight>
Line 3,597 ⟶ 3,610:
=={{header|Wren}}==
{{trans|Go}}
<syntaxhighlight lang="ecmascriptwren">var selectionSort = Fn.new { |a|
var last = a.count - 1
for (i in 0...last) {
Line 3,614 ⟶ 3,627:
}
 
var asarray = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ]
for (a in asarray) {
System.print("Before: %(a)")
selectionSort.call(a)
Line 3,633 ⟶ 3,646:
Alternatively we can just call a library method.
{{libheader|Wren-sort}}
<syntaxhighlight lang="ecmascriptwren">import "./sort" for Sort
 
var asarray = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ]
for (a in asarray) {
System.print("Before: %(a)")
Sort.selection(a)
PureFox
9,492

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/328452...349291"