aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2023-12-16 21:33:55 -08:00
parent 35bcdeebf8
commit 74c69a0df6
2427 changed files with 31826 additions and 3468 deletions
Download patch file Download diff file Expand all files Collapse all files

19
Task/Sorting-algorithms-Counting-sort/EasyLang/sorting-algorithms-counting-sort.easy Normal file
View file

@ -0,0 +1,19 @@
proc countsort min max . d[] .
len count[] max - min + 1
for n in d[]
count[n - min + 1] += 1
.
z = 1
for i = min to max
while count[i - min + 1] > 0
d[z] = i
z += 1
count[i - min + 1] -= 1
.
.
.
for i = 1 to 100
d[] &= random 1000
.
countsort 1 1000 d[]
print d[]

2
Task/Sorting-algorithms-Counting-sort/Elena/sorting-algorithms-counting-sort.elena
View file

@ -30,7 +30,7 @@ extension op
public program()
{
var list := new Range(0, 10).selectBy:(i => randomGenerator.eval(10)).toArray();
var list := new Range(0, 10).selectBy:(i => randomGenerator.nextInt(10)).toArray();
console.printLine("before:", list.asEnumerable());
console.printLine("after :", list.countingSort().asEnumerable())