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-09-16 17:28:03 -07:00
parent 5af6d93694
commit 796d366b97
455 changed files with 7413 additions and 1900 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -12,17 +12,17 @@ proc qsort left right . d[] .
swap d[left] d[mid]
#
if mid < (right + left) / 2
call qsort left mid - 1 d[]
qsort left mid - 1 d[]
left = mid + 1
else
call qsort mid + 1 right d[]
qsort mid + 1 right d[]
right = mid - 1
.
.
.
func sort . d[] .
call qsort 1 len d[] d[]
proc sort . d[] .
qsort 1 len d[] d[]
.
d[] = [ 29 4 72 44 55 26 27 77 92 5 ]
call sort d[]
sort d[]
print d[]