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 2025-06-11 20:16:52 -04:00
parent 72eb4943cb
commit 4d5544505c
2347 changed files with 62432 additions and 16731 deletions
Download patch file Download diff file Expand all files Collapse all files

26
Task/Sorting-algorithms-Quicksort/EasyLang/sorting-algorithms-quicksort.easy
View file

@ -1,19 +1,19 @@
proc qsort left right . d[] .
if left >= right
return
.
mid = left
for i = left + 1 to right
if d[i] < d[left]
mid += 1
swap d[i] d[mid]
proc qsort left right &d[] .
if left < right
piv = d[left]
mid = left
for i = left + 1 to right
if d[i] < piv
mid += 1
swap d[i] d[mid]
.
.
swap d[left] d[mid]
qsort left mid - 1 d[]
qsort mid + 1 right d[]
.
swap d[left] d[mid]
qsort left mid - 1 d[]
qsort mid + 1 right d[]
.
proc sort . d[] .
proc sort &d[] .
qsort 1 len d[] d[]
.
d[] = [ 29 4 72 44 55 26 27 77 92 5 ]